Pith. sign in

REVIEW 4 cited by

Towards Foundation Models for Mixed Integer Linear Programming

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.08288 v2 pith:UHANL67A submitted 2024-10-10 cs.LG

classification cs.LG
keywords milpclasseslearningdiversefoundationgeneralizemodelproblems
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Mixed Integer Linear Programming (MILP) is essential for modeling complex decision-making problems but faces challenges in computational tractability and requires expert formulation. Current deep learning approaches for MILP focus on specific problem classes and do not generalize to unseen classes. To address this shortcoming, we take a foundation model training approach, where we train a single deep learning model on a diverse set of MILP problems to generalize across problem classes. As existing datasets for MILP lack diversity and volume, we introduce MILP-Evolve, a novel LLM-based evolutionary framework that is capable of generating a large set of diverse MILP classes with an unlimited amount of instances. We study our methodology on three key learning tasks that capture diverse aspects of MILP: (1) integrality gap prediction, (2) learning to branch, and (3) a new task of aligning MILP instances with natural language descriptions. Our empirical results show that models trained on the data generated by MILP-Evolve achieve significant improvements on unseen problems, including MIPLIB benchmarks. Our work highlights the potential of moving towards a foundation model approach for MILP that can generalize to a broad range of MILP applications. Our code and data are publicly available at https://github.com/microsoft/OptiGuide.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

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

    cs.AI 2026-05 conditional novelty 6.0 of 10

    LLM-guided evolutionary search over executable SCIP callbacks can discover competitive joint cut-selection and branching policies for MILP solving.

  2. A Survey of Optimization Modeling Meets LLMs: Progress and Future Directions

    cs.AI 2025-08 conditional novelty 5.0 of 10

    A survey of LLM-based optimization modeling, plus an audit revealing high error rates in existing benchmarks and a cleaned leaderboard.

  3. Multi-task Representation Learning for Mixed Integer Linear Programming

    cs.AI 2024-12 conditional novelty 5.0 of 10

    A two-step multi-task training strategy for MILP solving produces embeddings that match specialized models in-distribution and generalize better on larger instances and new tasks.

  4. Large Language Models for Next-Generation Wireless Network Management: A Survey and Tutorial

    cs.NI 2025-09 conditional novelty 4.0 of 10

    A survey and tutorial that organizes LLM-enabled wireless network optimization into formulation, solution, and verification stages, with case studies drawn from the authors' own prior papers.

Pith tools