Transferring information across restarts in MIP

DOI10.1007/978-3-031-08011-1_3zbMath1502.68267OpenAlexW4293203590MaRDI QIDQ2170173

Domenico Salvagnin, Gregor Hendel, Timo Berthold

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08011-1_3

zbMATH Keywords

mixed integer programmingglobal searchrestart

Mathematics Subject Classification ID

Mixed integer programming (90C11) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• SCIP
• CPLEX
• MINTO
• XPRESS
• Chaff

Cites Work

• Unnamed Item
• Unnamed Item
• Enhanced mixed integer programming techniques and routing problems
• Cutting planes in integer and mixed integer programming
• SCIP: solving constraint integer programs
• MINTO, a Mixed INTeger Optimizer
• Branching rules revisited
• Conflict graphs in solving integer programming problems
• Experiments with conflict analysis in mixed integer programming
• Restarting algorithms: sometimes there is free lunch
• Structure-driven fix-and-propagate heuristics for mixed integer programming
• Conflict analysis in mixed integer programming
• Presolve Reductions in Mixed Integer Programming
• Rapid Learning for Binary Programs
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Estimating the Size of Branch-and-Bound Trees
• Experiments in mixed-integer linear programming
• Enhancing MIP Branching Decisions by Using the Sample Variance of Pseudo Costs