A feasibility pump heuristic for general mixed-integer problems

Discrete Optimization

Volumn 4, Issue 1, 2007, Pages 63-76

  Bertacco, Livio ^a,b   Fischetti, Matteo ^a   Lodi, Andrea ^c  

^a UNIVERSITY OF PADOVA   (Italy)

^b Dash Optimization Ltd   (United Kingdom)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Computational analysis; Feasibility problem; Heuristics; Mixed integer programming

Indexed keywords

COMPUTATIONAL METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

COMPUTATIONAL ANALYSIS; FEASIBILITY PROBLEMS; FEASIBILITY PUMP (FP); MIXED-INTEGER PROGRAMMING;

HEURISTIC METHODS;

EID: 33846586040     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2006.10.001     Document Type: Article

References (22)

1. T. Achterberg, SCIP-a framework to integrate constraint and mixed integer programming, Technical report 04-19, Zuse Institute, Berlin, 2004. Available at http://www.zib.de/Publications/abstracts/ZR-04-19/
2. T. Achterberg, T. Berthold, Improving the feasibility pump, Technical report, Zuse Institute, Berlin, September 2005
3. T. Achterberg, T. Koch, A. Martin, MIPLIB 2003, Technical report 05-28, Zuse Institute, Berlin, 2005. Available at http://www.zib.de/PaperWeb/abstracts/ZR-05-28/
4. Balas E., Ceria S., Dawande M., Margot F., and Pataki G. OCTANE: A new heuristic for pure 0-1 programs. Operations Research 49 (2001) 207-225
5. Balas E., and Martin C.H. Pivot-and-complement: A heuristic for 0-1 programming. Management Science 26 (1980) 86-96
6. Balas E., Schmieta S., and Wallace C. Pivot and shift-A mixed integer programming heuristic. Discrete Optimization 1 (2004) 3-12
7. J.W. Chinneck, J. Patel, Faster MIP solutions through better variable ordering, ISMP 2003, Copenhagen, August 2003
8. Dash Xpress-Optimizer 16.01.05: Getting started and reference manual, Dash Optimization Ltd, 2004. http://www.dashoptimization.com/
9. Danna E., Rothberg E., and Le Pape C. Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming 102 (2005) 71-90
10. Fischetti M., and Lodi A. Local branching. Mathematical Programming 98 (2003) 23-47
11. Fischetti M., Glover F., and Lodi A. The feasibility pump. Mathematical Programming 104 (2005) 91-104
12. Glover F., and Laguna M. General purpose heuristics for integer programming: Part I. Journal of Heuristics 2 (1997) 343-358
13. Glover F., and Laguna M. General purpose heuristics for integer programming: Part II. Journal of Heuristics 3 (1997) 161-179
14. Glover F., and Laguna M. Tabu Search (1997), Kluwer Academic Publisher, Boston, Dordrecht, London
15. Hillier F.S. Effcient heuristic procedures for integer linear programming with an interior. Operations Research 17 (1969) 600-637
16. Ibaraki T., Ohashi T., and Mine H. A heuristic algorithm for mixed-integer programming problems. Mathematical Programming Study 2 (1974) 115-136
17. ILOG Cplex 9.1: User's manual and reference manuals, ILOG, S.A., 2004. http://www.ilog.com/
18. Løkketangen A. Heuristics for 0-1 mixed-integer programming. In: Pardalos P.M., and Resende M.G.C. (Eds). Handbook of Applied Optimization (2002), Oxford University Press 474-477
19. Løkketangen A., and Glover F. Solving zero/one mixed integer programming problems using tabu search. European Journal of Operational Research 106 (1998) 624-658
20. H.D. Mittelmann, Benchmarks for optimization software: Testcases. http://plato.asu.edu/topics/testcases.html
21. M. Nediak, J. Eckstein, Pivot, cut, and dive: A heuristic for 0-1 mixed integer programming, Research report RRR 53-2001, RUTCOR, Rutgers University, October 2001
22. L. Peeters, Cyclic railway timetable optimization, ERIM Ph.D. Series, Erasmus University Rotterdam, June, 2003