Progressively strengthening and tuning MIP solvers for reoptimization

DOI10.1007/s12532-024-00253-zzbMath1543.90162MaRDI QIDQ6590467

Krunal Kishor Patel

Publication date: 21 August 2024

Published in: Mathematical Programming Computation (Search for Journal in Brave)

zbMATH Keywords

MIPreoptimizationwarmstartparameter-tuningpseudocosts

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization
• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
• IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
• A theory and algorithms for combinatorial reoptimization
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Branching rules revisited
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• A framework for generalized Benders' decomposition and its application to multilevel optimization
• Transferring information across restarts in MIP
• Column generation based heuristic for learning classification trees
• Structure-driven fix-and-propagate heuristics for mixed integer programming
• Improving the Integer L-Shaped Method
• A Computational Study of Search Strategies for Mixed Integer Programming
• Experiments in mixed-integer linear programming
• Enhancing MIP Branching Decisions by Using the Sample Variance of Pseudo Costs
• Finite-time analysis of the multiarmed bandit problem

Related Items (1)

The MIP workshop 2023 computational competition on reoptimization

This page was built for publication: Progressively strengthening and tuning MIP solvers for reoptimization