论文信息 - Improving the Performance of MIP and MINLP Solvers by Integrated Heuristics

Improving the Performance of MIP and MINLP Solvers by Integrated Heuristics

This article provides an overview of the author’s dissertation (Berthold, Heuristic algorithms in global MINLP solvers, 2014, [4]). We study heuristic algorithms that are tightly integrated within global MINLP solvers and analyze their impact on the overall solution process. This comprises generalizations of primal heuristics for MIP towards MINLP as well as novel ideas for MINLP primal heuristics and for heuristic algorithms to take branching decisions and to collect global information in MIP.

Timo Berthold

[1] Peter J. Stuckey,et al. Rapid Learning for Binary Programs , 2010, CPAIOR.

[2] Timo Berthold,et al. Measuring the impact of primal heuristics , 2013, Oper. Res. Lett..

[3] Timo Berthold,et al. Undercover: a primal MINLP heuristic exploring a largest sub-MIP , 2014, Math. Program..

[4] Timo Berthold,et al. Extending a CIP framework to solve MIQCPs , 2012 .

[5] Robert E. Bixby,et al. MIP: Theory and Practice - Closing the Gap , 1999, System Modelling and Optimization.

[6] Timo Berthold. Heuristic algorithms in global MINLP solvers , 2014 .

[7] Tobias Achterberg,et al. Mixed Integer Programming: Analyzing 12 Years of Progress , 2013 .

[8] Thorsten Koch,et al. Constraint Integer Programming: A New Approach to Integrate CP and MIP , 2008, CPAIOR.

[9] Timo Berthold. The optimal rounding , 2014 .

[10] A. Lodi,et al. Heuristics in Mixed Integer Programming , 2011 .

[11] Fred W. Glover,et al. The feasibility pump , 2005, Math. Program..

[12] Timo Berthold,et al. Shift-and-Propagate , 2015, J. Heuristics.

[13] Timo Berthold. RENS: The optimal rounding , 2014 .