The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights
Not on the map. Why?
Abstract (arXiv)
Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolation, ignoring that they often stem from related data distributions in practice. However, recent years have seen a surge of interest in using machine learning as a new approach for solving combinatorial problems, either directly as solvers or by enhancing exact solvers. Based on this context, the ML4CO aims at improving state-of-the-art combinatorial optimization solvers by replacing key heuristic components. The competition featured three challenging tasks: finding the best feasible solution, producing the tightest optimality certificate, and giving an appropriate solver configuration. Three realistic datasets were considered: balanced item placement, workload apportionment, and maritime inventory routing. This last dataset was kept anonymous for the contestants.
Key facts. Cited by 39 papers in the map (data through 7 Oct 2026). Builds on 11 of its 25 references that are in the map. First posted on arXiv 4 Mar 2022.
Builds on
11 of 25 references.
References · 11
- 2017Learning Combinatorial Optimization Algorithms over Graphscited by 557
- 2018Born Again Neural Networkscited by 539
- 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 327
- 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 313
- 2018Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Searchcited by 182
- 2020Solving Mixed Integer Programs Using Neural Networkscited by 178
- 2020Hybrid Models for Learning to Branchcited by 95
- 2018Learning to Branchcited by 78
- 2020Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimizationcited by 63
- 2020Ecole: A Gym-like Library for Machine Learning in Combinatorial Optimization Solverscited by 43
- 2018Learning to Run challenge solutions: Adapting reinforcement learning methods for neuromusculoskeletal environmentscited by 19
Built on by
Citing papers per year: 2022: 1; 2023: 7; 2024: 11; 2025: 12; 2026: 8.
39 papers.
Sort:
By area:
- 2024Towards Foundation Models for Mixed Integer Linear Programmingcited by 30
- 2024Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programmingcited by 24
- 2024MILP-StuDio: MILP Instance Generation via Block Structure Decompositioncited by 17
- 2025Apollo-MILP: An Alternating Prediction-Correction Neural Solving Framework for Mixed-Integer Linear Programmingcited by 16
- 2024Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methodscited by 15
- 2023Learning to Configure Separators in Branch-and-Cutcited by 14
- 2023Promoting Generalization for Exact Solvers via Adversarial Instance Augmentationcited by 12
- 2023Learning To Dive In Branch And Boundcited by 10
- 2024Learning to Stop Cut Generation for Efficient Mixed-Integer Linear Programmingcited by 8
- 2024LLMs for Cold-Start Cutting Plane Separator Configurationcited by 8
- 2024Multi-task Representation Learning for Mixed Integer Linear Programmingcited by 6
- 2025Riemannian Optimization on Relaxed Indicator Matrix Manifoldcited by 5
27 more
- 2023Reinforcement Learning for Node Selection in Branch-and-Boundcited by 4
- 2024Model Uncertainty in Evolutionary Optimization and Bayesian Optimization: A Comparative Analysiscited by 4
- 2025CoCo-MILP: Inter-Variable Contrastive and Intra-Constraint Competitive MILP Solution Predictioncited by 4
- 2026LLM4Branch: Large Language Model for Discovering Efficient Branching Policies of Integer Programscited by 4
- 2023Exact Combinatorial Optimization with Temporo-Attentional Graph Neural Networkscited by 3
- 2025When GNNs meet symmetry in ILPs: an orbit-based feature augmentation approachcited by 3
- 2025RoME: Domain-Robust Mixture-of-Experts for MILP Solution Prediction across Domainscited by 3
- 2022Structured Q-learning For Antibody Designcited by 2
- 2024An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrollingcited by 2
- 2025Are Your Generated Instances Truly Useful? GenBench-MILP: A Benchmark Suite for MILP Instance Generationcited by 2
- 2025Principled Data Augmentation for Learning to Solve Quadratic Programming Problemscited by 2
- 2025Constraint Matters: Multi-Modal Representation for Reducing Mixed-Integer Linear programmingcited by 2
- 2023TreeDQN: Sample-Efficient Off-Policy Reinforcement Learning for Combinatorial Optimizationcited by 1
- 2023Threshold-aware Learning to Generate Feasible Solutions for Mixed Integer Programscited by 1
- 2024RL-SPH: Learning to Achieve Feasible Solutions for Integer Linear Programscited by 1
- 2025BenLOC: A Benchmark for Learning to Configure MIP Optimizerscited by 1
- 2026A General Neural Backbone for Mixed-Integer Linear Optimization via Dual Attentioncited by 1
- 2026GRIMIP: A General Framework for Instance-Specific Configuration of MIP Solvers Using LLMscited by 1
- 2024Graph Coloring Using Heat Diffusioncited by 0
- 2025FMIP: Joint Continuous-Integer Flow For Mixed-Integer Linear Programmingcited by 0
- 2025Collab-Solver: Collaborative Solving Policy Learning for Mixed-Integer Linear Programmingcited by 0
- 2025Feature Augmentation of GNNs for ILPs: Local Uniqueness Sufficescited by 0
- 2026Designing faster mixed integer linear programming algorithm via learning the optimal pathcited by 0
- 2026SRG: Score-based Relaxation-guided Generation for Mixed Integer Linear Programmingcited by 0
- 2026Crystal structure prediction using graph neural combinatorial optimizationcited by 0
- 2026GraphBU: MILP Instance Generation with Graph-Native Block Unitscited by 0
- 2026DCEmbed: Scalable Optimization over Neural Surrogatescited by 0
- 2026DCEmbed: Scalable Optimization over Neural Surrogates27 Sep 2026
- 2026GraphBU: MILP Instance Generation with Graph-Native Block Units7 Jul 2026
- 2026GRIMIP: A General Framework for Instance-Specific Configuration of MIP Solvers Using LLMs22 Jun 2026
- 2026LLM4Branch: Large Language Model for Discovering Efficient Branching Policies of Integer Programs11 May 2026
- 2026Crystal structure prediction using graph neural combinatorial optimization27 Apr 2026
- 2026SRG: Score-based Relaxation-guided Generation for Mixed Integer Linear Programming25 Mar 2026
- 2026Designing faster mixed integer linear programming algorithm via learning the optimal path22 Jan 2026
- 2026A General Neural Backbone for Mixed-Integer Linear Optimization via Dual Attention8 Jan 2026
- 2025CoCo-MILP: Inter-Variable Contrastive and Intra-Constraint Competitive MILP Solution Prediction12 Nov 2025
- 2025RoME: Domain-Robust Mixture-of-Experts for MILP Solution Prediction across Domains4 Nov 2025
- 2025Feature Augmentation of GNNs for ILPs: Local Uniqueness Suffices25 Sep 2025
- 2025Constraint Matters: Multi-Modal Representation for Reducing Mixed-Integer Linear programming26 Aug 2025
27 more
- 2025Collab-Solver: Collaborative Solving Policy Learning for Mixed-Integer Linear Programming5 Aug 2025
- 2025FMIP: Joint Continuous-Integer Flow For Mixed-Integer Linear Programming31 Jul 2025
- 2025BenLOC: A Benchmark for Learning to Configure MIP Optimizers3 Jun 2025
- 2025Principled Data Augmentation for Learning to Solve Quadratic Programming Problems2 Jun 2025
- 2025Are Your Generated Instances Truly Useful? GenBench-MILP: A Benchmark Suite for MILP Instance Generation30 May 2025
- 2025Riemannian Optimization on Relaxed Indicator Matrix Manifold26 Mar 2025
- 2025Apollo-MILP: An Alternating Prediction-Correction Neural Solving Framework for Mixed-Integer Linear Programming3 Mar 2025
- 2025When GNNs meet symmetry in ILPs: an orbit-based feature augmentation approach24 Jan 2025
- 2024Multi-task Representation Learning for Mixed Integer Linear Programming18 Dec 2024
- 2024LLMs for Cold-Start Cutting Plane Separator Configuration16 Dec 2024
- 2024An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling2 Dec 2024
- 2024RL-SPH: Learning to Achieve Feasible Solutions for Integer Linear Programs29 Nov 2024
- 2024MILP-StuDio: MILP Instance Generation via Block Structure Decomposition30 Oct 2024
- 2024Towards Foundation Models for Mixed Integer Linear Programming10 Oct 2024
- 2024Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods11 Jun 2024
- 2024Graph Coloring Using Heat Diffusion21 Apr 2024
- 2024Model Uncertainty in Evolutionary Optimization and Bayesian Optimization: A Comparative Analysis21 Mar 2024
- 2024Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming8 Feb 2024
- 2024Learning to Stop Cut Generation for Efficient Mixed-Integer Linear Programming31 Jan 2024
- 2023Exact Combinatorial Optimization with Temporo-Attentional Graph Neural Networks23 Nov 2023
- 2023Learning to Configure Separators in Branch-and-Cut8 Nov 2023
- 2023Promoting Generalization for Exact Solvers via Adversarial Instance Augmentation22 Oct 2023
- 2023Reinforcement Learning for Node Selection in Branch-and-Bound29 Sep 2023
- 2023Threshold-aware Learning to Generate Feasible Solutions for Mixed Integer Programs1 Aug 2023
- 2023TreeDQN: Sample-Efficient Off-Policy Reinforcement Learning for Combinatorial Optimization9 Jun 2023
- 2023Learning To Dive In Branch And Bound24 Jan 2023
- 2022Structured Q-learning For Antibody Design10 Sep 2022
- 2024Towards Foundation Models for Mixed Integer Linear Programmingcited by 30
- 2024Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programmingcited by 24
- 2024MILP-StuDio: MILP Instance Generation via Block Structure Decompositioncited by 17
- 2025Apollo-MILP: An Alternating Prediction-Correction Neural Solving Framework for Mixed-Integer Linear Programmingcited by 16
- 2024Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methodscited by 15
- 2023Learning to Configure Separators in Branch-and-Cutcited by 14
- 2023Promoting Generalization for Exact Solvers via Adversarial Instance Augmentationcited by 12
- 2023Learning To Dive In Branch And Boundcited by 10
- 2024Learning to Stop Cut Generation for Efficient Mixed-Integer Linear Programmingcited by 8
- 2024LLMs for Cold-Start Cutting Plane Separator Configurationcited by 8
- 2024Multi-task Representation Learning for Mixed Integer Linear Programmingcited by 6
- 2025Riemannian Optimization on Relaxed Indicator Matrix Manifoldcited by 5
12 most cited of 38 All 38 (JSON)
- 2026DCEmbed: Scalable Optimization over Neural Surrogates27 Sep 2026
- 2026GraphBU: MILP Instance Generation with Graph-Native Block Units7 Jul 2026
- 2026GRIMIP: A General Framework for Instance-Specific Configuration of MIP Solvers Using LLMs22 Jun 2026
- 2026LLM4Branch: Large Language Model for Discovering Efficient Branching Policies of Integer Programs11 May 2026
- 2026Crystal structure prediction using graph neural combinatorial optimization27 Apr 2026
- 2026SRG: Score-based Relaxation-guided Generation for Mixed Integer Linear Programming25 Mar 2026
- 2026Designing faster mixed integer linear programming algorithm via learning the optimal path22 Jan 2026
- 2026A General Neural Backbone for Mixed-Integer Linear Optimization via Dual Attention8 Jan 2026
- 2025CoCo-MILP: Inter-Variable Contrastive and Intra-Constraint Competitive MILP Solution Prediction12 Nov 2025
- 2025Feature Augmentation of GNNs for ILPs: Local Uniqueness Suffices25 Sep 2025
- 2025Constraint Matters: Multi-Modal Representation for Reducing Mixed-Integer Linear programming26 Aug 2025
- 2025Collab-Solver: Collaborative Solving Policy Learning for Mixed-Integer Linear Programming5 Aug 2025
12 newest of 38 All 38 (JSON)