28 articles tagged with #combinatorial-optimization. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers introduce L2R, a learning-based framework that enables neural networks to solve vehicle routing problems at unprecedented scale by dynamically reducing search space through pattern recognition. The method achieves high-quality solutions on instances with 10 million nodes, representing a significant breakthrough in neural combinatorial optimization.
Researchers propose LU-KV, a novel framework for optimizing KV cache eviction in large language models by formulating budget allocation as a combinatorial optimization problem. The approach reduces KV cache size by 80% while maintaining performance, significantly lowering inference latency and GPU memory requirements.
Researchers introduce CHECKMATE, a tool that automatically generates optimization algorithms through code evolution, requiring only formal problem specifications and natural language descriptions rather than expert-designed heuristics. The evolved algorithms outperform state-of-the-art solvers on industrial configuration and scheduling problems, demonstrating formal methods can guide automated algorithm discovery for complex real-world optimization challenges.
Researchers introduce LoRe, a training-free optimization method that dynamically routes computational resources to high-priority interactions in iterative graph solvers, achieving 8× speedup and 12× memory reduction on combinatorial optimization problems while maintaining solution quality.
Researchers introduce AHD Agent, a reinforcement learning framework that enables language models to autonomously design heuristics for solving complex combinatorial optimization problems. A 4-billion-parameter model achieves performance comparable to much larger systems while requiring significantly fewer computational evaluations, advancing the frontier of AI-driven algorithm design.
Researchers developed a new neural solver model using GCON modules and energy-based loss functions that achieves state-of-the-art performance across multiple graph combinatorial optimization tasks. The study demonstrates effective transfer learning between related optimization problems through computational reducibility-informed pretraining strategies, representing progress toward foundational AI models for combinatorial optimization.
Researchers developed AILS-AHD, a novel approach using Large Language Models to solve the Capacitated Vehicle Routing Problem (CVRP) more efficiently. The LLM-driven method achieved new best-known solutions for 8 out of 10 instances in large-scale benchmarks, demonstrating superior performance over existing state-of-the-art solvers.
Researchers propose constraint injection, a novel verification technique that detects missing or spurious constraints in LLM-generated optimization code. VRPCoder, an 8B model fine-tuned with this method, achieves 93% accuracy on vehicle routing problems, significantly outperforming GPT and Claude models on constraint-dense combinatorial optimization tasks.
Researchers introduce DyNACO, a neural-guided optimization framework that dynamically adjusts guidance during iterative search processes rather than relying on static priors. The system scales to 100,000-node problem instances and demonstrates performance improvements over existing neural baselines while maintaining computational efficiency.
Researchers introduce a framework for training neural networks to solve combinatorial puzzles optimally by enforcing admissibility constraints—ensuring heuristics never overestimate remaining costs. The method combines an underestimating Bellman operator with asymmetric loss functions and post-hoc calibration, achieving significant reductions in search node expansions while maintaining solution optimality.
Researchers introduce CoEvo-AHD, an LLM-driven framework that co-evolves paired operator populations to solve coupled combinatorial optimization problems like the Traveling Thief Problem. Unlike previous automated heuristic design methods that treat operators in isolation, this approach captures interactions between decision components, achieving competitive results with traditional heuristics.
Researchers propose MViewRouter, a deep reinforcement learning framework that solves combinatorial routing problems like TSP and CVRP by embedding geometric symmetries directly into the model architecture rather than relying on data augmentation. The approach uses multi-view alternating attention and collective policy gradient aggregation to achieve more consistent decision-making and improved generalization across problem variants.
Researchers introduce an updated benchmark suite and algorithmic framework for the Linear Ordering Problem (LOP), a fundamental combinatorial optimization challenge with applications in economics and machine learning. The work addresses limitations of existing evaluation methods by incorporating contemporary economic data and proposing solutions for handling multiple optimal outcomes.
Researchers propose BaSE, a multi-armed bandit algorithm that optimizes how large language models allocate computational resources during evolutionary search tasks. By dynamically distributing LLM calls across parallel trajectories, BaSE improves mean fitness by 12.3% over existing baselines while addressing the reliability gap between reported best-case and typical run performance.
Researchers introduce DynaSchedBench, a calibrated framework for testing AI agents on dynamic job scheduling problems, revealing that large language models underperform expectations. The study uncovers an 'Observability Paradox' where providing agents with complete information actually degrades performance, and shows LLM-based schedulers fail to consistently outperform traditional heuristic baselines despite significant computational overhead.
Researchers have developed an enhanced Large Neighborhood Search (LNS) algorithm to solve a variant of the capacitated facility location problem that incorporates customer incompatibilities, where certain customer pairs cannot share the same facility. The new method employs hybrid destroy operators and exact solvers, achieving superior performance over existing metaheuristics on all benchmark instances.
Researchers propose DRLHQ, a deep reinforcement learning approach with heterogeneous query attention mechanisms to solve capacitated location-routing problems (CLRPs) and their open variants. This marks the first end-to-end learning framework for CLRPs, demonstrating superior performance over traditional and DRL-based baselines on benchmark datasets.
Researchers propose Constraint-Aware Residual Modulation (CARM), a neural module that improves how AI solvers handle complex vehicle routing problems by maintaining global observation during constraint-aware decision-making. The advancement demonstrates significant performance improvements across multiple routing problem variants and scaling capabilities.
Researchers propose a teacher-aware evolutionary framework that leverages pre-trained learned optimization policies to guide the automatic design of heuristic programs for combinatorial optimization problems. The method uses behavioral feedback from teacher policies during evolution rather than relying solely on endpoint performance, achieving better results than baseline LLM-driven approaches without requiring neural inference at deployment.
Researchers introduce Neural CFRS, a non-autoregressive neural network framework that solves the Capacitated Vehicle Routing Problem by clustering nodes first, then routing—departing from sequential autoregressive methods. The approach uses differentiable optimal transport to enforce capacity constraints and achieves competitive results on benchmarks while scaling robustly to large, out-of-distribution instances.
Researchers present CM-Tabu, a composite-move Tabu search algorithm that solves spatial redistricting optimization problems more effectively by expanding the feasible solution space while maintaining district contiguity constraints. The method uses graph analysis to identify minimal unit movements or swaps that preserve connectivity, achieving superior solution quality and computational efficiency compared to traditional approaches.
Researchers introduce HMACE, a multi-agent AI framework that uses specialized language model agents to design heuristics for combinatorial optimization problems. The system achieves competitive results on benchmark problems while using significantly fewer computational tokens than existing methods, demonstrating improved efficiency in automated algorithm design.
Researchers propose a decoupled iterative framework for multi-agent coordination that separates target assignment from pathfinding, achieving better scalability than existing conflict-based approaches. The method leverages fast suboptimal solvers like LaCAM and feedback-driven reassignment to handle larger agent systems while maintaining acceptable solution quality.
Researchers introduce a resilience framework for bi-criteria combinatorial optimization under noisy conditions, extending bandit feedback algorithms from single-objective to multi-objective settings. The framework achieves sublinear regret bounds without requiring structural assumptions like linearity or submodularity, with potential applications to constrained optimization problems in machine learning and algorithmic decision-making.
Researchers propose a top-down approach to automatic heuristic design for combinatorial optimization using large language models, where interpretable knowledge becomes the primary search object rather than executable code. This knowledge-first paradigm improves discovery efficiency and generalization across problems compared to traditional code-centric methods, suggesting future progress in AI-driven optimization depends on building reusable, explicit hypotheses.
