Tag
This paper introduces COOPA, a modular LLM agent architecture for operations research problems that combines iterative confidence-based modeling, element-level provenance, and multi-solver routing. Evaluated across eight LLM backbones and four baselines, COOPA achieves the best macro-average accuracy on six backbones and improves over the strongest baseline by up to 6.7 percentage points.
本文介绍ORAgentBench，一个用于评估LLM代理在端到端运筹学任务中表现的执行基准，包含107个经过人工审查的任务。实验表明，当前最佳代理仅通过35.51%的任务，揭示了在可靠决策制定方面的重大不足。
This paper introduces SkillChain-Gym, a benchmark specification for reskilling-aware production-inventory control that models worker skill dynamics, training actions, and disruption scenarios to evaluate policy regimes.
This paper introduces Bellman-Taylor Score Decoding, a method to handle state-dependent feasible action sets in Markov decision processes, addressing a key challenge in applying deep reinforcement learning to operations research problems.
Researchers from Beihang University and Baidu propose 'constraint injection,' a dual verification method for LLM-based optimization modeling that detects spurious or omitted constraints beyond objective equivalence. They develop VRPCoder, an 8B model for translating natural-language vehicle routing problems into Gurobi scripts, achieving 93% average Pass@1 and outperforming Claude Sonnet and prior OR-LLMs by large margins.
This paper introduces a totally unimodular linear programming reformulation for alignment-based conformance checking, which complements A* search by providing speedups for long traces with deviations. The approach achieves 38.6% average runtime savings with 96% selection accuracy.
The article argues that current benchmarks for Constraint Acquisition are inadequate and introduces MPMMine, a benchmark suite designed to assess algorithms that discover, validate, and enhance mathematical programming models using diverse domain knowledge artifacts.
OR-Space is a benchmark for evaluating large language model agents in industrial operations research workflows, focusing on multi-stage task lifecycles and persistent workspaces beyond simple text generation.
TriVAL introduces a tri-validation framework that performs explicit validation at three stages of automatic optimization modeling (semantic specification, mathematical formulation, code generation) to improve faithfulness, and also presents NL4COP, a new benchmark for combinatorial optimization problems.
This paper presents a hybrid approach combining dynamic programming and constraint programming to solve the Partial Shop Scheduling Problem, demonstrating the viability of integrating both paradigms despite not outperforming pure CP solvers.
This paper introduces Text2Opt-Bench, a scalable benchmark for text-to-optimization, and identifies that LLMs struggle with 'binding' (grounding problem data) rather than 'modeling' (choosing optimization structure). The authors propose BIND, a simple inference-time method that externalizes numeric data, significantly improving accuracy across models.
This paper presents a constraint programming approach to determine NHL playoff clinching scenarios with n-day lookahead, using tree search and preprocessing techniques.
The article discusses using Google's OR-Tools CP-SAT solver to optimize maintenance scheduling for cloud infrastructure at Akamai, addressing complex constraints like capacity and concurrency.
This is a digitized 1965 IBM document detailing the application of linear programming to ice cream blending optimization.
MIT Professor Dimitris Bertsimas received the 54th James R. Killian Faculty Achievement Award and delivered a lecture on how his work in operations research and AI has driven real-world improvements in logistics, healthcare, education, and agriculture. His robust optimization approaches have enabled practical benefits such as improving hospital patient throughput and optimizing Panama Canal vessel scheduling.