REVIEW 3 cited by
Bridging Large Language Models and Optimization: A Unified Framework for Text-attributed Combinatorial Optimization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
To advance capabilities of large language models (LLMs) in solving combinatorial optimization problems (COPs), this paper presents the Language-based Neural COP Solver (LNCS), a novel framework that is unified for the end-to-end resolution of diverse text-attributed COPs. LNCS leverages LLMs to encode problem instances into a unified semantic space, and integrates their embeddings with a Transformer-based solution generator to produce high-quality solutions. By training the solution generator with conflict-free multi-task reinforcement learning, LNCS effectively enhances LLM performance in tackling COPs of varying types and sizes, achieving state-of-the-art results across diverse problems. Extensive experiments validate the effectiveness and generalizability of the LNCS, highlighting its potential as a unified and practical framework for real-world COP applications.
Forward citations
Cited by 3 Pith papers
-
LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers
A pretrained LLM converts cross-task validation gaps into a five-number guidance signal injected into each encoder layer, improving several multi-task VRP solvers by roughly 0.1–0.5 percentage points on trained and un...
-
GeoRouteNet: A Geometry-Aware Non-Autoregressive Neural Solver for the Euclidean Traveling Salesman Problem
GeoRouteNet improves non-autoregressive neural TSP solvers via geometric inductive biases and MCS-RL training, reporting 0.32% gap on TSP50, 1.26% on TSP100, and 3.60% on TSPLIB instances with higher throughput than C...
-
Enhancing CVRP Solver through LLM-driven Automatic Heuristic Design
LLM-evolved ruin heuristics, embedded in an iterated local search solver, produce 8 new best-known solutions on large-scale CVRPLib instances and a lower average gap than HGS and AILS-II.
Discussion (0). Continue with ORCID to comment.