The MIP workshop 2023 computational competition on reoptimization
From MaRDI portal
Publication:6590466
DOI10.1007/s12532-024-00256-wzbMath1545.90004MaRDI QIDQ6590466
Claudia D'Ambrosio, Joseph Paat, Ambros M. Gleixner, Dimitri Thomopulos, Timo Berthold, Suresh Bolusani, Gonzalo Muñoz, Mathieu Besançon
Publication date: 21 August 2024
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Unnamed Item
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- A reoptimization algorithm for the shortest path problem with time windows
- Dual decomposition in stochastic integer programming
- A theory and algorithms for combinatorial reoptimization
- The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- Reinforcement learning for variable selection in a branch and bound algorithm
- Column generation based heuristic for learning classification trees
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- MIPLIB 2003
- Improving the Integer L-Shaped Method
- Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse
- Combining Progressive Hedging with a Frank--Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming
- Generating hydro unit commitment instances
- Progressively strengthening and tuning MIP solvers for reoptimization
- Enabling research through the SCIP Optimization Suite 8.0
This page was built for publication: The MIP workshop 2023 computational competition on reoptimization
