The feasibility pump

Mathematical Programming

Volumn 104, Issue 1, 2005, Pages 91-104

  Fischetti, Matteo ^a   Glover, Fred ^b   Lodi, Andrea ^c  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITY OF COLORADO   (United States)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; FUNCTIONS; HEURISTIC METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING;

FEASIBLE SOLUTIONS; SCALAR ROUNDING;

COMPUTATIONAL COMPLEXITY;

EID: 24044549331     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-004-0570-3     Document Type: Article

References (24)

1. Achterberg, T., Koch, T., Martin, A.: The mixed integer programming library: MIPLIB 2003. http://miplib.zib.de.
2. 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)
3. Balas, E., Martin, C.H. : Pivot-And-Complement: A Heuristic For 0-1 Programming. Management Science 26, 86-96 (1980)
4. Balas, E., Schmieta, S., Wallace, C.: Pivot and Shift-A Mixed Integer Programming Heuristic. Discrete Optimization 1, 3-12 (2004)
5. Bixby, R.E.: Personal communication. 2003
6. Chinneck, J.W.: The constraint consesus method for finding approximately feasible points in nonlinear programs. Technical Report Carleton University, Ottawa, Ontario, Canada, October 2002
7. Danna, E., Rothberg, E., Le Paper, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming, 102, 71-90 (2005)
8. Double-Click sas.: Personal communication. 2001
9. Fischetti, M., Lodi. A.: Local Branching. Mathematical Programming 98, 23-47 (2003)
10. Glover, F., Laguna, M.: General Purpose Heuristics For Integer Programming: Part I. J. Heuristics 2, 343-358 (1997)
11. Glover, F., Laguna, M.: General Purpose Heuristics For Integer Programming: Part II. J. Heuristics 3, 161-179 (1997)
12. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publisher, Boston, Dordrecht, London, 1997
13. Hillier, F.S.: Effcient Heuristic Procedures For Integer Linear Programming With An Interior. Oper. Res. 17, 600-637 (1969)
14. Ibaraki, T., Ohashi, T., Mine, H.: A Heuristic Algorithm For Mixed-Integer Programming Problems. Mathematical Programming Study 2, 115-136 (1974)
15. G.W. Klau. Personal communication, 2002.
16. Løkketangen, A.: Heuristics for 0-1 Mixed-Integer Programming. In: P.M. Pardalos, M.G.C. Resende (eds.), Handbook of Applied Optimization, Oxford University Press, 2002, pp. 474-477
17. Løkketangen, A., Glover, F.: Solving Zero/One Mixed Integer Programming Problems Using Tabu Search. European J. Oper. Res. 106, 624-658 (1998)
18. Lübbecke, M.: Personal communication. 2002
19. Miller, A J.: Personal communication. 2003
20. Nediak, M., Eckstein, J.: Pivot, Cut, and Dive: A Heuristic for 0-1 Mixed Integer Programming. Research Report RRR 53-2001, RUTCOR, Rutgers University, October 2001
21. Patel, J., Chinneck, J.W.: Active-Constraint Variable Ordering for Faster Feasibility of Mixed Integer Linear Programs. Technical Report Carleton University, Ottawa, Ontario, Canada, November 2003
22. Rothberg, E.: Personal communication. 2002
23. Rothberg, E.: Personal communication. 2003
24. Spielberg, K., Guignard, M.: Sequential (Quasi) Hot Start Method for BB (0,1) Mixed Integer Programming. Wharton School Research Report, 2002