arXiv AI

Learning Early-to-Final Solution Consistency for MILP Acceleration

arXiv:2608. 19953v1 Announce Type: new Abstract: Mixed-Integer Linear Programming (MILP) is a fundamental problem class in operations research and combinatorial optimization, with broad applications to industrial decision-making.

Hugging Face Trending Papers

1d ago

Learning Early-to-Final Solution Consistency for MILP Acceleration

Mixed-Integer Linear Programming (MILP) is a fundamental problem class in operations research and combinatorial optimization, with broad applications to industrial decision-making. Owing to their NP-hardness, however, modern solvers may struggle to find high-quality solutions for challenging MILP instances within practical time limits.

benchmarks

arXiv Machine Learning

Jun 18

FORGE: Foundational Optimization Representations from Graph Embeddings

arXiv:2508. 20330v5 Announce Type: replace Abstract: Combinatorial optimization problems are ubiquitous in science and engineering.

By Zohair Shafi, Serdar Kadioglu

rag fine-tuning efficiency benchmarks

arXiv Machine Learning

Jun 2

Learning-Augmented Scalable Linear Assignment Problem Optimization via Neural Dual Warm-Starts

arXiv:2605. 09382v2 Announce Type: replace Abstract: The Linear Assignment Problem is a fundamental combinatorial optimization task where classical exact solvers ensure optimality but suffer from an $\mathcal{O}(N^{3})$ bottleneck, while recent neural approximations struggle with scalability and exactness.

By Ilay Yavlovich, Jad Agbaria, Muhamed Mhamed, Nir Weinberger, Jose Yallouz

arXiv Machine Learning

Jun 25

Learning Structural Hardness for Combinatorial Auctions: Instance-Dependent Algorithm Selection via Graph Neural Networks

arXiv:2602. 14772v2 Announce Type: replace Abstract: The Winner Determination Problem (WDP) in combinatorial auctions is NP-hard, and no existing method reliably predicts which instances will defeat fast greedy heuristics.

By Sungwoo Kang

benchmarks safety

arXiv Machine Learning

Jun 9

ML-Guided Primal Heuristics for Mixed Binary Quadratic Programs

arXiv:2604. 23053v2 Announce Type: replace Abstract: Mixed Binary Quadratic Programs (MBQPs) are an important and complex set of problems in combinatorial optimization.

By Weimin Huang, Natalie M. Isenberg, J\'an Drgo\v{n}a, Draguna L Vrabie, Bistra Dilkina

benchmarks

arXiv AI

Jun 2

FrontierOR: Benchmarking LLMs' Capacity for Efficient Algorithm Design in Large-Scale Optimization

arXiv:2605. 25246v3 Announce Type: replace Abstract: Large language models (LLMs) are increasingly used for optimization modeling and solver-code generation, yet practical operations research and optimization problems often require a harder capability: designing scalable algorithms that exploit problem structure and outperform direct formulation-and-solve baselines.

By Minwei Kong, Chonghe Jiang, Ao Qu, Wenbin Ouyang, Zhaoming Zeng, Xiaotong Guo, Zhekai Li, Junyi Li, Yi Fan, Xinshou Zheng, Xi Jing, Yikai Zhang, Zhiwei Liang, Seonghoo Kim, Runqing Yang, Zijian Zhou, Sirui Li, Han Zheng, Wangyang Ying, Ou Zheng, Chonghuan Wang, Jinglong Zhao, Hanzhang Qin, Cathy Wu, Paul Pu Liang, Jinhua Zhao, Hai Wang

llms agents benchmarks

arXiv AI

Jul 22

MILP-Evo: Closed-Loop Fully Automatic Design of MILP Solvers

arXiv:2607. 18252v1 Announce Type: new Abstract: Machine learning methods have shown that data-driven policies can accelerate mixed-integer linear programming (MILP) solvers, but many such approaches remain difficult to inspect, adapt, and deploy because the learned policy is represented as an external predictor or other opaque model.

By Jinbiao Nie, Kewei Feng, Xiaoyuan Zhang, Shan Yin, Zizhuo Wang, Bin Dong

llms benchmarks

arXiv Machine Learning

Jul 16

Learned Pairwise Deep Dual-Optimal Inequalities for Stabilizing Column Generation

arXiv:2607. 13373v1 Announce Type: cross Abstract: Column generation (CG) is central to many large-scale optimization algorithms, including branch-price-and-cut methods for vehicle routing problems, but unstable dual solutions can substantially slow its convergence.

By Zhengzhong Ricky You, Bo Tang, Haoran Liu, Baichuan Mo

arXiv Machine Learning

Jun 8

The Proxy Benders Decomposition

arXiv:2606. 07403v1 Announce Type: cross Abstract: Benders decomposition is a fundamental framework for solving large-scale mixed-integer optimization problems with complicating variables that, when fixed, yield significantly easier subproblems.

By Changkun Guan, El Mehdi Er Raqabi, Mathieu Tanneau, Pascal Van Hentenryck

arXiv AI

Jun 2

Position Paper: Post-Solve Robustness in Decision Engines: Feasible Regions and Smoothness Under Perturbations

arXiv:2606. 00002v1 Announce Type: new Abstract: Mixed-Integer Linear Programming (MILP) decision engines routinely output nominally optimal plans for high-stakes industrial systems.

By Yi-Xiang Hu

safety

arXiv AI

Jun 16

StarOR: Synergizing Tree Search and Test-Time Reinforcement Learning for Optimization Modeling

arXiv:2606. 15197v1 Announce Type: cross Abstract: Optimization modeling is inherently hierarchical, requiring a precise sequence of symbolic commitments.

By Jiajun Li, Yu Ding, Shisi Guan, Ran Hou, Wanyuan Wang

llms reinforcement-learning fine-tuning benchmarks

arXiv Machine Learning

Jun 30

Evolution Fine-Tuning: Learning to Discover Across 371 Optimization Tasks

arXiv:2606. 29082v1 Announce Type: cross Abstract: Would experience designing faster GPU kernels also help close in on a long-standing open mathematical conjecture?

By Young-Jun Lee, Seungone Kim, Minki Kang, Alistair Cheong Liang Chuen, Zerui Chen, Seungho Han, Taehee Jung, Dongyeop Kang

llms agents reinforcement-learning fine-tuning benchmarks

Related stories