mlsanityData to 14 Oct 2026

LLMs for Cold-Start Cutting Plane Separator Configuration

arXiv 2412.12038 ↗First posted 16 Dec 2024cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

Mixed integer linear programming (MILP) solvers expose hundreds of parameters that have an outsized impact on performance but are difficult to configure for all but expert users. Existing machine learning (ML) approaches require training on thousands of related instances, generalize poorly and can be difficult to integrate into existing solver workflows. We propose a large language model (LLM)-based framework that configures cutting plane separators using problem descriptions and solver-specific separator summaries. To reduce variance in LLM outputs, we introduce an ensembling strategy that clusters and aggregates candidate configurations into a small portfolio of high-performing configurations. Our method requires no custom solver interface, generates configurations in seconds via simple API calls, and requires solving only a small number of instances. Extensive experiments on standard synthetic and real-world MILPs show our approach matches or outperforms state-of-the-art configuration methods with a fraction of the data and computation.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 37 of its 67 references that are in the map. First posted on arXiv 16 Dec 2024.

Builds on

37 of 67 references.

References · 37

  1. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  2. 2022Large Language Models are Zero-Shot Reasonerscited by 4,374
  3. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  4. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
  5. 2021WebGPT: Browser-assisted question-answering with human feedbackcited by 1,745
  6. 2023A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questionscited by 1,601
  7. 2023Teaching Large Language Models to Self-Debugcited by 988
  8. 2018Attention, Learn to Solve Routing Problems!cited by 656
  9. 2023Automatic Prompt Optimization with "Gradient Descent" and Beam Searchcited by 653
  10. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 623
  11. 2017Learning Combinatorial Optimization Algorithms over Graphscited by 561
  12. 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 318
25 more
  1. 2023Prompting Large Language Model for Machine Translation: A Case Studycited by 250
  2. 2019Reinforcement Learning for Integer Programming: Learning to Cutcited by 111
  3. 2014ParamILS: An Automatic Algorithm Configuration Frameworkcited by 89
  4. 2023DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimizationcited by 78
  5. 2023Using Large Language Models for Hyperparameter Optimizationcited by 71
  6. 2023Large Language Models for Supply Chain Optimizationcited by 64
  7. 2022Learning To Cut By Looking Ahead: Cutting Plane Selection via Imitation Learningcited by 61
  8. 2024Smaller, Weaker, Yet Better: Training LLM Reasoners via Compute-Optimal Samplingcited by 61
  9. 2022Augmenting Operations Research with Auto-Formulation of Optimization Models from Problem Descriptionscited by 54
  10. 2022MIP-GNN: A Data-Driven Framework for Guiding Combinatorial Solverscited by 49
  11. 2024Autoformulation of Mathematical Optimization Models Using LLMscited by 48
  12. 2023Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Modelcited by 45
  13. 2022The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insightscited by 39
  14. 2024OptiMUS-0.3: Using Large Language Models to Model and Solve Optimization Problems at Scalecited by 38
  15. 2021Sample Complexity of Tree Search Configuration: Cutting Planes and Beyondcited by 33
  16. 2023Holy Grail 2.0: From Natural Language to Constraint Modelscited by 26
  17. 2024Sequential Large Language Model-Based Hyper-parameter Optimizationcited by 24
  18. 2022Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cutscited by 19
  19. 2023"I Want It That Way": Enabling Interactive Decision Support Using Large Language Models and Constraint Programmingcited by 19
  20. 2018Theoretical challenges towards cutting-plane selectioncited by 16
  21. 2024Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methodscited by 15
  22. 2023Learning to Configure Separators in Branch-and-Cutcited by 14
  23. 2018Automatic Construction of Parallel Portfolios via Explicit Instance Groupingcited by 11
  24. 2020Generalization in portfolio-based algorithm selectioncited by 7
  25. 2024An investigation on the use of Large Language Models for hyperparameter tuning in Evolutionary Algorithmscited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 5; 2026: 3.

8 papers.