| This week at a glance |
|
0
s
|
0
New papers
|
3
Active fronts
|
This week's theme:Concept-structured search is outperforming brute code mutation across multiple optimization domains.
|
|
Top Priority Papers
0 papers this week (ranked by significance, recency and impact)
| | No priority papers this week. |
Research Front Landscape
3 active fronts | 0 new papers
| |
Advanced LLM Agents for Symbolic OR Modeling and Problem Reformulation
EMERGING Density: 0.11 12 papers
Methodsllm_code_generation llm_in_the_loop llm_as_evaluator program_synthesis llm_as_heuristic
Inst:Georgia Institute of. 8% · Queen's University 8% · Xi’an Jiaotong University 8% · Ministry of Education. 8%
This front unifies research on leveraging advanced LLM architectures, particularly multi-agent systems and sophisticated memory/retrieval mechanisms, for symbolic Operations Research modeling, code generation and automated problem reformulation. Key frameworks like OptiMUS-0.3, MIRROR, AutoREM and DCM-Agent are central, demonstrating how LLMs are being engineered to translate natural language descriptions into executable optimization models (MILP, LP, MiniZinc), reformulate complex problems (e.g., Robust Optimization) and even generate expert-level heuristics. The emphasis is on improving the reliability and accuracy of LLM-generated OR artifacts beyond simple prompting. OptiMUS-0.3 and MIRROR establish new SOTA for MILP formulation, with OptiMUS-0.3 outperforming GPT-4o by ~40% on NLP4LP using a connection graph and self-reflection and MIRROR achieving ~72% pass@1 with hierarchical RAG and structured revision. AutoREM introduces a tuning-free memory-augmented framework for robust optimization reformulation, achieving 97.4% accuracy on in-distribution and 94.8% on out-of-distribution datasets. AutoOR demonstrates scalable RL-trained LLMs for autoformalization, with an 8B model matching Gemini 3 Pro on several benchmarks and achieving a 48.98% leap on non-linear pump network tasks via backtranslation. Other notable contributions include CHORUS's metadata-augmented RAG for LP code generation (+147.9% accuracy for Llama3.3-70B), OptiMind's fine-tuning and class-based error analysis for MILP formulation (up to +23% accuracy) and OR-Agent's tree-structured research workflow for algorithm discovery, showing a ~2x improvement over FunSearch. The Dual-Cluster Memory Agent (DCM-Agent) achieves SOTA on symbolic OR modeling benchmarks with 11-21% average accuracy improvements by decoupling abstract modeling from concrete coding. This front is rapidly emerging and maturing, characterized by a shift from basic LLM prompting to highly engineered, multi-agent and memory-augmented systems. The focus is increasingly on reliability, verification and scalability, as evidenced by rigorous benchmarking (e.g., OptiMind's benchmark audit, AutoRO-Bench) and advanced training techniques (AutoOR's backtranslation and curriculum RL). The next wave of papers will likely concentrate on integrating these sophisticated LLM agents with real-time data, developing more robust self-correction mechanisms for non-linear and stochastic problems and exploring online learning for dynamic memory evolution, pushing towards fully autonomous OR problem-solving pipelines.
| |
Structured LLM-Driven Optimization Modeling via Verification and Self-Improving Agents
STABLE Density: 0.19 34 papers
Methodsllm_in_the_loop llm_code_generation llm_as_evaluator llm_as_heuristic program_synthesis
Inst:Shanghai Jiao Tong. 15% · Huawei Noah’s Ark. 12% · Shanghai University of. 12% · City University of. 9%
This research front unifies advancements in leveraging Large Language Models (LLMs) for automated optimization modeling, problem formulation and solver component generation. A core theme is the shift from basic code generation to ensuring semantic correctness, robustness and continuous self-improvement. Key frameworks like ReLoop, OptiMUS, SIRL, AlphaOPT and StepORLM emphasize structured generation, advanced verification techniques and adaptive agentic architectures for complex Operations Research (OR) domains, including multi-period retail inventory, optimal power flow and Mixed-Integer Linear Programming (MILP) solver plugins. Key contributions include ReLoop's behavioral verification, which exposed a 90% gap between execution feasibility and semantic correctness on RetailOpt-190 and ORGEval's graph-theoretic evaluation, achieving 100% consistency in seconds for model isomorphism. Self-improvement is driven by methods like OptiRepair's RL-trained agents with a 'Rationality Oracle' achieving 81.7% success in model repair and SIRL's Reinforcement Learning with Verifiable Reward (RLVR) using 'Partial KL' for enhanced LLM proficiency. Structured generation is advanced by OptiMUS's 'Connection Graph' for multi-agent orchestration (+31.5% accuracy on NL4OPT) and SolverLLM's LLM-guided MCTS with 'Prompt Backpropagation' for dynamic prompt modification. Benchmarking efforts like MIPLIB-NL revealed that SOTA models drop from ~90% accuracy on toy benchmarks to ~18% on industrial-scale MILPs, highlighting the need for more robust evaluation. Notably, Agentic MIP Research used an AlphaEvolve-like framework to generate SCIP constraint handlers, discovering five novel patterns that solved previously unsolved instances on MIPLIB 2017. This front is rapidly emerging and maturing, with a clear trajectory towards integrating more sophisticated formal verification methods and adaptive, self-correcting multi-agent architectures. Future work will likely focus on tackling larger-scale, more ambiguous industrial problems through robust data synthesis and evaluation, moving beyond purely outcome-based rewards to leverage process-level feedback and structured representations. The emphasis is on developing LLM agents that can not only generate solutions but also rigorously verify, diagnose and iteratively refine them, leading to more reliable and scalable OR automation.
| |
Execution-Verified LLM Agents for OR Model and Algorithm Synthesis
STABLE Density: 0.09 34 papers
Methodsllm_code_generation llm_in_the_loop llm_as_heuristic llm_as_evaluator program_synthesis
Inst:Cornell University 9% · Shanghai Jiao Tong. 9% · Tsinghua University 9% · The Chinese University. 9%
This research front focuses on developing sophisticated LLM agents for Operations Research, moving beyond simple code generation to encompass full problem formalization, algorithm design and solution verification. It highlights frameworks like NEMO, OptiTrust and ConstraintLLM that leverage LLMs for generating executable optimization models (MILP, CP, DP) from natural language descriptions. A core unifying theme is the integration of solver feedback and execution verification within multi-agent architectures to ensure the correctness and performance of generated OR artifacts. Key contributions include the establishment of rigorous benchmarks such as CO-Bench (36 combinatorial optimization problems), HeuriGym (9 hard combinatorial optimization problems), OptiVerse (1,000 problems across six domains) and ORCOpt-Bench, which provide standardized metrics for evaluating LLM capabilities. Methodologically, papers like EVOM and SAGE utilize Group Relative Policy Optimization (GRPO) with solver outcomes for robust model generation, achieving state-of-the-art Pass@1 accuracies (e.g., SAGE improving 72.7% to 80.3% on OR benchmarks). Multi-agent systems like Agora-Opt and EngiAgent achieve superior performance (e.g., Agora-Opt 84.6% Pass@1) by employing decentralized debate and dynamic feedback routing for complex engineering and OR problems. This research front is rapidly maturing, characterized by a significant shift from basic prompting to sophisticated feedback-driven learning and multi-agent architectures. The strong emphasis on execution-verified rewards (e.g., GRPO, Pipeline-Adapted Reward Models like PARM) and robust benchmarking (e.g., Multi-Instance Accuracy in DCP-Bench-Open) indicates a clear trajectory towards reliability and practical applicability. Future work will likely focus on scaling these methods to larger, more complex industrial problems, integrating more advanced domain-specific knowledge and developing more efficient training paradigms such as Virtual Reinforcement Learning (VisionCreator) to reduce the substantial computational costs associated with extensive execution feedback loops.
|
Cross-Front Bridge Papers
5 papers connecting multiple research fronts
| |
TRUE SYNTHESIS Front 1 → Front 0, Front 2
2024-07-29 · 2407.19633
OptiMUS-0.3 is a modular multi-agent system that translates natural language into Gurobi code, utilizing a 'connection graph' to manage variable-constraint relationships in long contexts and specializ...
| |
TRUE SYNTHESIS Front 2 → Front 0, Front 1
2025-07-15 · 2507.11737
Zhou et al. introduce DPLM, a 7B model fine-tuned to formulate Dynamic Programming models, achieving performance comparable to o1 on their new DP-Bench. Their key contribution is 'DualReflect,' a synt...
| |
TRUE SYNTHESIS Front 2 → Front 0, Front 1
2025-08-05 · 2508.03117
Lima et al. introduce a pipeline to generate synthetic optimization datasets by starting with symbolic MILP instances (ground truth) and using LLMs to generate natural language descriptions, ensuring...
| |
TRUE SYNTHESIS Front 2 → Front 0
2026-02-08 · 2601.21008
Ao et al. introduce a framework for iterative OR model debugging that trains an 8B model using Group Relative Policy Optimization (GRPO) and a Process Reward Model (PRM) to outperform GPT-4o-mini. The...
| |
TRUE SYNTHESIS Front 1 → Front 0, Front 2
2025-05-02 · 2505.01485
CHORUS introduces a RAG framework for generating Gurobi code that replaces standard code retrieval with a metadata-based approach, indexing code examples by generated keywords and summaries rather tha...
|
Framework Genealogy
Tracking research lineages and framework evolution
|
37frameworks tracked ·37root frameworks ·2active (last 30 days)
Framework landscape (size = paper count, color = ratio)
funsearch (3 papers, 3 ) • grpo (2 papers, 2 ) • optimus (2 papers, 1 ) • alphaevolve (1 papers, 1 ) • autoor (1 papers, 1 ) • holy_grail_2.0 (1 papers, 0 ) • evom (1 papers, 1 ) • gs_schedule (1 papers, 0 ) • reloop (1 papers, 1 ) • chain_of_experts (1 papers, 0 )
■Active + ■Active ■Inactive + ■Inactive
|
|