Heuristics in Mixed Integer Programming

MILP heuristics aim at finding a feasible (and hopefully good) solution of the problem above, which is an NP-hard problem by itself. We present the main ideas underlying some of the heuristics proposed in the literature. In particular, in this article we focus on those algorithms developed with the aim of being tightly integrated within MILP solvers. Keywords: mixed integer linear programming; heuristics; branch-and-bound; rounding

[1]  Frederick S. Hillier,et al.  Efficient Heuristic Procedures for Integer Linear Programming with an Interior , 1969, Oper. Res..

[2]  Hisashi Mine,et al.  A heuristic algorithm for mixed-integer programming problems , 1974 .

[3]  Frederick S. Hillier,et al.  Interior Path Methods for Heuristic Integer Programming Procedures , 1979, Oper. Res..

[4]  E. Balas,et al.  Pivot and Complement–A Heuristic for 0-1 Programming , 1980 .

[5]  Kurt Jörnsten,et al.  Tabu search within a pivot and complement framework , 1994 .

[6]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[7]  Egon Balas,et al.  Octane: A New Heuristic for Pure 0-1 Programs , 2001, Oper. Res..

[8]  E. Balas,et al.  Pivot and shift - a mixed integer programming heuristic , 2004, Discret. Optim..

[9]  Matteo Fischetti,et al.  A local branching heuristic for mixed‐integer programs with 2‐level variables, with an application to a telecommunication network design problem , 2004, Networks.

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

[11]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

[12]  Pierre Hansen,et al.  Variable neighborhood search and local branching , 2004, Comput. Oper. Res..

[13]  Edward Rothberg,et al.  An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions , 2007, INFORMS J. Comput..

[14]  Timo Berthold,et al.  RENS - Relaxation Enforced Neighborhood Search , 2007 .

[15]  Jonathan Eckstein,et al.  Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming , 2007, J. Heuristics.

[16]  Tobias Achterberg,et al.  Constraint integer programming , 2007 .

[17]  Louis-Martin Rousseau,et al.  Modeling the Regular Constraint with Integer Programming , 2007, CPAIOR.

[18]  Timo Berthold,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Improving the Feasibility Pump Improving the Feasibility Pump , 2022 .

[19]  Matteo Fischetti,et al.  A feasibility pump heuristic for general mixed-integer problems , 2007, Discret. Optim..

[20]  Shubhashis Ghosh,et al.  DINS, a MIP Improvement Heuristic , 2007, IPCO.

[21]  Matteo Fischetti,et al.  Repairing MIP infeasibility through local branching , 2008, Comput. Oper. Res..

[22]  Matteo Fischetti,et al.  Feasibility pump 2.0 , 2009, Math. Program. Comput..

[23]  Samir Elhedhli,et al.  An interior point cutting plane heuristic for mixed integer programming , 2011, Comput. Oper. Res..