Feasibility pump 2.0

Mathematical Programming Computation

Volumn 1, Issue 2-3, 2009, Pages 201-222

  Fischetti, Matteo ^a   Salvagnin, Domenico ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

Constraint programming; Constraint propagation; Mixed integer programming; Primal heuristics

Indexed keywords

COMPUTATIONAL RESULTS; CONSTRAINT PROGRAMMING; CONSTRAINT PROPAGATION; FEASIBLE SOLUTION; FRACTIONAL SOLUTIONS; MIXED-INTEGER PROGRAMMING; PRIMAL HEURISTICS; ROUNDING HEURISTICS;

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

INTEGER PROGRAMMING;

EID: 80052570312     PISSN: 18672949     EISSN: 18672957     Source Type: Journal    
DOI: 10.1007/s12532-009-0007-3     Document Type: Article

References (32)

1. Achterberg, T.: Constraint integer programming. PhD thesis, Technische Universität Berlin, (2007)
2. Achterberg, T., Berthold, T.: Improving the feasibility pump. Discrete Optim. 4, 77-86 (2007)
3. Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett., 34:361-372. Problems available at http://miplib.zib.de (2006)
4. Balas, E., Ceria, S., Dawande, M., Margot, F., Pataki, G.: OCTANE: A new heuristic for pure 0-1 programs. Oper. Res. 49, 207-225 (2001)
5. Balas, E., Martin, C.: Pivot-and-complement: A heuristic for 0-1 programming. Manage. Sci. 26, 86-96 (1980)
6. Balas, E., Schmieta, S., Wallace, C.: Pivot and shift-a mixed integer programming heuristic. Discrete Optim. 1, 3-12 (2004)
7. Bertacco, L.: Feasibility pump. Source code available at http://www.or.deis.unibo.it/research_pages/ ORcodes/FP-gen.html
8. Bertacco, L., Fischetti, M., Lodi, A.: A feasibility pump heuristic for general mixed-integer problems. Discrete Optim. 4, 63-76 (2007)
9. Danna, E., Rothberg, E., Pape, C.L.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. 102, 71-90 (2005)
10. Eckstein, J., Nediak, M.: Pivot, cut, and dive: a heuristic for 0-1 mixed integer programming. J. Heuristics 13, 471-503 (2007)
11. Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104, 91-104 (2005)
12. Fischetti, M., Lodi, A.: Local branching. Math. Program. 98(1-3), 23-47 (2003)
13. Fischetti, M., Polo, C., Scantamburlo, M.: A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem. Networks 44, 61-72 (2004)
14. Gecode Team: Gecode: Generic constraint development environment, 2008. Available at http://www. gecode.org (2008)
15. Glover, F., Laguna, M.: General purpose heuristics for integer programming-part I. J. Heuristics 2, 343-358 (1997)
16. Glover, F., Laguna, M.: General purpose heuristics for integer programming-part II. J. Heuristics 3, 161-179 (1997)
17. Glover, F., Laguna, M.: Tabu Search. Kluwer, Dordrecht (1997)
18. Gondzio, J.: Presolve analysis of linear programs prior to applying an interior point method. INFORMS J. Comput. 9, 73-91 (1997)
19. Hansen, P., Mladenovíc, N., Urosevic, D.: Variable neighborhood search and local branching. Comput. Oper. Res. 33, 3034-3045 (2006)
20. Hillier, F.: Efficient heuristic procedures for integer linear programming with an interior. Oper. Res. 17, 600-637 (1969)
21. Hooker, J.N.: Integrated Methods for Optimization. Springer, New York (2006)
22. Ibaraki, T., Ohashi, T., Mine, F.:Aheuristic algorithm for mixed-integer programming problems. Math. Program. Study 2, 115-136 (1974)
23. ILOG. CPLEX 11.0 User's manual (2008)
24. Lagerkvist M.Z., Schulte C.: Advisors for incremental propagation. In: Bessière C. (ed.) Thirteenth international conference on principles and practice of constraint programming. Lecture notes in computer science, vol. 4741, pp. 409-422. Springer-Verlag, New York (2007)
25. Løkketangen, A.: Heuristics for 0-1 mixed-integer programming. In: Pardalos, P., Garey, M.R. (eds.) Handbook of Applied Optimization, pp. 474-477. Oxford University Press, Oxford (2002)
26. Løkketangen, A., Glover, F.: Solving zero/one mixed integer programming problems using tabu search. Eur. J. Oper. Res. 106, 624-658 (1998)
27. Maros, I.: Computational Techniques of the Simplex Method. Kluwer, Dordrecht (2002)
28. Mittelmann, H.D.: Benchmarks for optimization software: Testcases. Problems available at http:// plato.asu.edu/sub/testcases.html
29. Rossi, F., van Beek, P., Walsh, T. (eds.): Computational Techniques of the Simplex Method. Elsevier, Amsterdam (2006)
30. Savelsbergh, M.W.P.: Preprocessing and probing for mixed integer programming problems. ORSA J. Comput. 6, 445-454 (1994)
31. Schulte, C.: Programming constraint services. PhD thesis, Universität des Saarlandes, Naturwissenschaftlich-Technische Fakultät I, Fachrichtung Informatik, Saarbrücken, Germany (2000)
32. Schulte, C., Stuckey, P.J.: Speeding up constraint propagation. In Wallace M. (ed.) Principles and practice of constraint programming-CP 2004, 10th international conference. Lecture notes in computer science, vol. 3258, pp. 619-633. Springer (2004)