Boosting the feasibility pump

The feasibility pump (FP) has proved to be an effective method for finding feasible solutions to mixed integer programming problems. FP iterates between a rounding procedure and a projection procedure, which together provide a sequence of points alternating between LP feasible but fractional solutions, and integer but LP infeasible solutions. The process attempts to minimize the distance between consecutive iterates, producing an integer feasible solution when closing the distance between them. We investigate the benefits of enhancing the rounding procedure with a clever integer line search that efficiently explores a large set of integer points. An extensive computational study on benchmark instances demonstrates the efficacy of the proposed approach.

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

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

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

[4]  Fred W. Glover,et al.  General Purpose Heuristics for Integer Programming—Part II , 1997, J. Heuristics.

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

[6]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[7]  Margaréta Halická,et al.  Analyticity of the central path at the boundary point in semidefinite programming , 2002, Eur. J. Oper. Res..

[8]  Toby Walsh,et al.  Handbook of Constraint Programming (Foundations of Artificial Intelligence) , 2006 .

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

[10]  Christian Schulte,et al.  Programming Constraint Services , 2002, Lecture Notes in Computer Science.

[11]  Martin W. P. Savelsbergh,et al.  Preprocessing and Probing Techniques for Mixed Integer Programming Problems , 1994, INFORMS J. Comput..

[12]  Robert E. Bixby,et al.  Solving Real-World Linear Programs: A Decade and More of Progress , 2002, Oper. Res..

[13]  Peter J. Stuckey,et al.  Speeding Up Constraint Propagation , 2004, CP.

[14]  Robert G. Jeroslow,et al.  Experimental results on Hillier's linear search , 1975, Math. Program..

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

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

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

[18]  Robert E. Bixby,et al.  Progress in computational mixed integer programming—A look back from the other side of the tipping point , 2007, Ann. Oper. Res..

[19]  Fred W. Glover,et al.  Solving zero-one mixed integer programming problems using tabu search , 1998, European Journal of Operational Research.

[20]  Stefano Lucidi,et al.  New concave penalty functions for improving the Feasibility Pump , 2010 .

[21]  Mark Wallace,et al.  Principles and Practice of Constraint Programming – CP 2004 , 2004, Lecture Notes in Computer Science.

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

[23]  Jordi Castro,et al.  Using the analytic center in the feasibility pump , 2011, Oper. Res. Lett..

[24]  Fred W. Glover,et al.  General purpose heuristics for integer programming—Part I , 1997, J. Heuristics.

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

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

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

[28]  Nenad Mladenovic,et al.  Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility , 2010, Electron. Notes Discret. Math..