Local branching

Mathematical Programming

Volumn 98, Issue 1-3, 2003, Pages 23-47

  Fischetti, Matteo ^a   Lodi, Andrea ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Branch and bound; Heuristic; Local search; Mixed integer program

Indexed keywords

BRANCH AND BOUNDS; HEURISTIC; HEURISTIC SOLUTIONS; HIGH-QUALITY SOLUTIONS; LINEAR INEQUALITIES; LOCAL SEARCH; LOCAL SEARCH METAHEURISTICS; MIXED-INTEGER PROGRAMS;

APPLICATION PROGRAMS; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING;

HEURISTIC METHODS;

EID: 3042564211     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-003-0395-5     Document Type: Conference Paper

References (23)

1. Balas, E., Ceria, S., Dawande, M., Margot, F., Pataki, G.: OCTANE: A New Heuristic For Pure 0-1 Programs. Operations Research 49(2), 207-225 (2001)
2. Balas, E., Martin, C.H.: Pivot-And-Complement:AHeuristic For 0-1 Programming. Management Science 26(1), 86-96 (1980)
3. Belotti, P.: Personal communication, 2002
4. Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: MIPLIB 3.0. http://www.caam.rice.edu/∼ bixby/miplib/miplib.html.
5. Caprara, A., Fischetti, M., Toth, P.: A Heuristic Method For The Set Covering Problem. Operations Research 47, 730-743 (1999)
6. Cplex.: ILOG Cplex 7.0 User's Manual and Reference Manual. ILOG, S.A., 2001 (http://www.ilog.com)
7. Glover, F., Laguna, M.: General Purpose Heuristics For Integer Programming: Part I. Journal of Heuristics 2, 343-358 (1997)
8. Glover, F., Laguna, M.: General Purpose Heuristics For Integer Programming: Part II. JournalofHeuristics 3, 161-179 (1997)
9. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publisher, Boston, Dordrecht, London, 1997
10. Goessens, J.W., van Hoesel, S., Kroon, L.: A Branch-and-Cut Approach to Line Planning Problems. Working Paper, Erasmus University, 2001
11. Hillier, F.S.: Effcient Heuristic Procedures For Integer Linear Programming WithAn Interior. Operations Research 17(4), 600-637 (1969)
12. Ibaraki, T., Ohashi, T., Mine, H.: A Heuristic Algorithm For Mixed-Integer Programming Problems. Mathematical Programming Study 2, 115-136 (1974)
13. Kroon, L.: Personal communication, 2002
14. Kroon, L., Fischetti, M.: Crew Scheduling for Netherlands Railways: Destination Customer. In: Voss, S., Daduna, J.R., eds. Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, 2001, pp. 181-201
15. Løkketangen, A.: Heuristics for 0-1 Mixed-Integer Programming. In: Pardalos, P.M., Resende, M.G.C. eds. Handbook of Applied Optimization, Oxford University Press, 2002, pp. 474-477
16. Løkketangen, A., Glover, F.: Solving Zero/One Mixed Integer Programming Problems UsingTabu Search. European Journal of Operational Research 106, 624-658 (1998)
17. Luzzi, I.: Personal communication, 2001
18. Mannino, C., Parrello, E.: Personal communication, 2002
19. Mladenov́ic, N., Hansen, P.: Variable Neighborhood Search. Computers and Operations Research 24, 1097-1100 (1997)
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. Polo, C.: Algoritmi Euristici per il Progetto Ottimo di una Rete di Interconnessione. Tesi di laurea in Ingegneria Informatica, Universtità degli Studi di Padova, 2002 (in Italian)
22. TURNI.: User's Manual, Double-Click sas, 2001 (http://www.turni.it)
23. Van Vyve, M., Pochet, Y.: A General Heuristic for Production Planning Problems. CORE Discussion Paper 56, 2001