An augment-and-branch-and-cut framework for mixed 0-1 programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2570, Issue , 2003, Pages 119-133

  Letchford, Adam N ^a   Lodi, Andrea ^b  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BRANCH AND BOUND METHOD; COMBINATORIAL OPTIMIZATION; ITERATIVE METHODS; OPTIMIZATION;

0-1 PROGRAMMING; ABC ALGORITHMS; BRANCH AND CUT; CUTTING PLANE METHODS; INTEGER PROGRAM; INTEGER SOLUTIONS; OPTIMALITY;

INTEGER PROGRAMMING;

EID: 35248813891     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36478-1_12     Document Type: Article

References (28)

1. E. Balas, S. Ceria & G. Cornuéjols (1993) A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58, 295-324.
2. E. Balas, S. Ceria & G. Cornuéjols (1996) Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Mgt. Sci. 42, 1229-1246.
3. E. Balas, S. Ceria, C. Cornuéjols & N. Natraj (1996) Gomory cuts revisited. Oper. Res. Lett. 19, 1-9.
4. A. Ben-Israel & A. Charnes (1962) On some problems of diophantine programming. Cahiers du Centre d'Études de Recherche Opérationelle 4, 215-280.
5. A. Caprara & M. Fischetti (1997) Branch-and-Cut Algorithms. In M. Dell'Amico, F. Maffioli & S. Martello (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 45-64. New York, Wiley.
6. H. Crowder, E.L. Johnson & M.W. Padberg (1983) Solving large-scale zero-one linear programming problems. Oper. Res. 31, 803-834.
7. F. Eisenbrand, G. Rinaldi & P. Ventura (2001) 0/1 primal separation and 0/1 optimization are equivalent. Working paper, IASI, Rome.
8. R.T. Firla, U.-U. Haus, M. Köppe, B. Spille & R. Weismantel (2001) Integer pivoting revisited. Working paper, Institute of Mathematical Optimization, University of Magdeburg.
9. R.S. Garfinkel & G.L. Nemhauser (1972) Integer Programming. New York: Wiley.
10. F. Glover (1968) A new foundation for a simplified primal integer programming algorithm. Oper. Res. 16, 727-740.
11. R.E. Gomory (1958) Outline of an algorithm for integer solutions to linear programs. Bulletin of the AMS 64, 275-278.
12. R.E. Gomory (1960) An algorithm for the mixed-integer problem. Report RM-2597, Rand Corporation, 1960 (Never published).
13. M. Grötschel, L. Lovász & A.J. Schrijver (1988) Geometric Algorithms and Combinatorial Optimization. Wiley: New York.
14. U.-U. Haus, M. Köppe & R. Weismantel (2000) The integral basis method for integer programming. Math. Meth. of Oper. Res. 53, 353-361.
15. A.H. Land & A.G. Doig (1960) An automatic method for solving discrete programming problems. Econometrica 28, 497-520.
16. A.N. Letchford & A. Lodi (2001) Primal separation algorithms. Technical Report OR/01/5. DEIS, University of Bologna.
17. A.N. Letchford & A. Lodi (2002) Primal cutting plane algorithms revisited. Math. Methods of Oper. Res., to appear.
18. A.N. Letchford & A. Lodi (2002) Strengthening Chvátal-Gomory Cuts and Gomory fractional cuts. Oper. Res. Letters, to appear.
19. G.L. Nemhauser & L.A. Wolsey (1988) Integer and Combinatorial Optimization. New York: Wiley.
20. M.W. Padberg & M. Grötschel (1985) Polyhedral computations. In E. Lawler, J. Lenstra, A. Rinnooy Kan, D. Shmoys (eds.). The Traveling Salesman Problem, John Wiley & Sons, Chichester, 307-360.
21. M.W. Padberg & S. Hong (1980) On the symmetric travelling salesman problem: a computational study. Math. Program. Study 12, 78-107.
22. M.W. Padberg & G. Rinaldi (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric travelling salesman problems. SIAM Rev. 33, 60-100.
23. A. Schulz, R. Weismantel & G. Ziegler (1995) 0-1 integer programming: optimization and augmentation are equivalent. In: Lecture Notes in Computer Science, vol. 979. Springer.
24. R. Thomas (1995) A geometric Buchberger algorithm for integer programming. Math. Oper. Res. 20, 864-884.
25. R. Urbaniak, R. Weismantel & G. Ziegler (1997) A variant of Buchberger's algorithm for integer programming. SIAM J. on Discr. Math. 1, 96-108.
26. R. Weismantel (1999) Private communication.
27. R.D. Young (1965) A primal (all-integer) integer programming algorithm. J. of Res. of the National Bureau of Standards 69B, 213-250.
28. R.D. Young (1968) A simplified primal (all-integer) integer programming algorithm. Oper. Res. 16, 750-782.