One-shot learning for MIPs with SOS1 constraints

DOI10.1007/S43069-024-00336-6MaRDI QIDQ6579097FDOQ6579097

Authors: Jean-François Cordeau, Emma Frejinger 

Publication date: 25 July 2024

Published in: SN Operations Research Forum (Search for Journal in Brave)

Recommendations

• A multi-agent learning framework for mixed-integer linear programming
• Enhancing cut selection through reinforcement learning
• Progressively strengthening and tuning MIP solvers for reoptimization
• A neural branch-and-price for truck scheduling in cross-docks
• The MIP workshop 2023 computational competition on reoptimization

zbMATH Keywords

machine learningmixed integer programminglearning heuristicsfleet management problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)

Cites Work

• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• A Mathematical Theory of Communication
• An Automatic Method of Solving Discrete Programming Problems
• Local branching
• A feasibility pump heuristic for general mixed-integer problems
• Improving the feasibility pump
• The feasibility pump
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Proximity search for 0--1 mixed-integer convex programming
• RENS. The optimal rounding
• ZI round, a MIP rounding heuristic
• Information-theoretic approaches to branching in search
• Information-based branching schemes for binary linear mixed integer problems
• Rapid learning for binary programs
• Rounding and propagation heuristics for mixed integer programming
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Integer Programming
• On learning and branching: a survey
• A feasible rounding approach for mixed-integer optimization problems
• Generalization of machine learning for problem reduction: a case study on travelling salesman problems
• Deep learning with long short-term memory networks for financial market predictions
• Deep learning assisted heuristic tree search for the container pre-marshalling problem
• Mathematical programming based heuristics for the 0--1 MIP: a survey
• Algorithm selection for combinatorial search problems: a survey
• Local rapid learning for integer programs
• Graph Representation Learning
• Adaptive large neighborhood search for mixed integer programming
• Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
• JuMP 1.0: recent improvements to a modeling language for mathematical optimization
• Enabling research through the SCIP Optimization Suite 8.0

Cited In (5)

• A neural branch-and-price for truck scheduling in cross-docks
• Enhancing cut selection through reinforcement learning
• Progressively strengthening and tuning MIP solvers for reoptimization
• The MIP workshop 2023 computational competition on reoptimization
• A multi-agent learning framework for mixed-integer linear programming

This page was built for publication: One-shot learning for MIPs with SOS1 constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579097)