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