AIBullisharXiv – CS AI · Jun 237/10
🧠Researchers developed a framework using LLM agents to infer distribution-specific structure from sample optimization problems and compile it into specialized solver code. The synthesized solvers achieved 97.1% solution quality while running 75-125x faster than competition solvers on benchmark instances, demonstrating that AI agents can discover computational shortcuts tailored to problem distributions.
🧠 Claude
AIBullisharXiv – CS AI · Jun 27/10
🧠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.
AIBullisharXiv – CS AI · Jun 27/10
🧠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.
AIBullisharXiv – CS AI · Jun 17/10
🧠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.
AIBullisharXiv – CS AI · May 297/10
🧠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.
AIBullisharXiv – CS AI · May 127/10
🧠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.
AIBullisharXiv – CS AI · Mar 47/103
🧠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.
AIBullisharXiv – CS AI · Feb 277/105
🧠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.
AINeutralarXiv – CS AI · Jun 236/10
🧠Researchers introduce GeoRouteNet, a geometry-enhanced neural network solver for the Traveling Salesman Problem that achieves competitive optimality gaps (0.32% on TSP50, 1.26% on TSP100) through architectural innovations and a novel multi-candidate self-comparison reinforcement learning training approach. The method demonstrates superior cross-distribution generalization compared to existing non-autoregressive approaches while maintaining faster inference speeds than traditional solvers.
AINeutralarXiv – CS AI · Jun 196/10
🧠Researchers have developed a tool that automatically synthesizes probabilistic processor architectures for solving combinatorial optimization problems using the Ising model. The framework adaptively selects between multiple update algorithms and demonstrates improved convergence compared to fixed approaches, with potential applications in future hardware implementations using magnetic tunnel junctions.
AINeutralarXiv – CS AI · Jun 196/10
🧠Researchers introduce Evolving Programmatic Bottlenecks (EPB), a novel framework for interpreting Neural Combinatorial Optimization models by distilling them into human-readable program portfolios. The method uses large language models to autonomously evolve interpretable programs while maintaining performance comparable to the original black-box models, addressing a critical gap in AI explainability for complex sequential decision-making systems.
AINeutralarXiv – CS AI · Jun 106/10
🧠Researchers propose VaFM, a vision-assisted foundation model that combines visual and graph-based approaches to solve multi-task vehicle routing problems more effectively. The model addresses key limitations of existing solvers by incorporating constraint representations through image data, achieving superior performance across 16 VRP variants with complex constraints.
AINeutralarXiv – CS AI · Jun 96/10
🧠Researchers propose a framework for improving the robustness of deep reinforcement learning solvers for multi-objective combinatorial optimization problems by generating adversarial instances that expose weaknesses and training defenses using hardness-aware preference selection. The method demonstrates significant improvements in solver generalizability across traveling salesman, vehicle routing, and knapsack problems.
AIBullisharXiv – CS AI · Jun 96/10
🧠Researchers introduce Projected Consistency Inference (PCI), a neural optimization method that solves the Traveling Salesman Problem more efficiently than gradient-based approaches by using structure-aware projections and local search instead of computationally expensive refinement. PCI achieves better optimality gaps (0.17% for 500 cities, 0.31% for 1000 cities) while reducing inference time by 30-40% compared to state-of-the-art FT2T methods.
AIBullisharXiv – CS AI · Jun 96/10
🧠Researchers introduce IDEQ, an improved diffusion model approach for solving the Traveling Salesman Problem that achieves state-of-the-art results for neural network-based methods, matching or exceeding traditional heuristics like LKH3 on benchmark instances while maintaining better scalability.
AINeutralarXiv – CS AI · Jun 86/10
🧠Researchers propose EP-HUBO, a quantum-inspired optimization method that improves how large language models aggregate reasoning chains for evidence-intensive tasks like legal reasoning. By treating evidence selection as a combinatorial optimization problem rather than using simple majority voting, the approach preserves accurate minority hypotheses and achieves better performance on legal benchmarks.
AIBullisharXiv – CS AI · Jun 46/10
🧠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.
🧠 Claude🧠 Gemini
AINeutralarXiv – CS AI · Jun 46/10
🧠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.
AINeutralarXiv – CS AI · Jun 46/10
🧠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.
AINeutralarXiv – CS AI · Jun 25/10
🧠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.
AINeutralarXiv – CS AI · Jun 26/10
🧠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.
AINeutralarXiv – CS AI · Jun 15/10
🧠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.
AIBullisharXiv – CS AI · May 296/10
🧠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.
AIBearisharXiv – CS AI · May 286/10
🧠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.
AINeutralarXiv – CS AI · May 285/10
🧠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.
