Primal separation algorithms

4OR

Volumn 1, Issue 3, 2003, Pages 209-224

  Letchford, Adam N ^a   Lodi, Andrea ^b  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Integer programming; knapsack problem; primal algorithms; separation; stable set problem; travelling salesman problem

Indexed keywords

EID: 67649947028     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-003-0012-8     Document Type: Article

References (30)

1. Applegate D, Bixby RE, Chvátal V, Cook W (1998) On the solution of travelling salesman problems. Documenta Mathematica, Extra Volume ICM III, pp 645-656.
2. Balas E (1975) Facets of the knapsack polytope. Mathematical Programming 8: 146-164.
3. Balas E (1989) The asymmetric assignment problem and some new facets of the travelling salesman polytope. SIAM Journal of Discrete Mathematics 2: 425-451.
4. Bollobás B, Erdos P (1976) Cliques in random graphs. Proc. Camb. Phil. Soc. 80: 419-427.
5. Borndörfer R, Weismantel R (2000) Set packing relaxations of integer programs. Mathematical Programming 88: 425-450.
6. Caprara A, FischettiM (1996) {0, 1/2}-Chvátal-Gomory cuts. Mathematical Programming 74: 221-235.
7. Caprara A, Fischetti M (1997) Branch-and-Cut Algorithms. In: Dell'Amico M, Maffioli F, Martello S (eds) Annotated Bibliographies in Combinatorial Optimization. Wiley, NewYork, pp 45-64.
8. Crowder H, Johnson EL, Padberg MW (1983) Solving large-scale zero-one linear programming problems. Operations Research 31: 803-834.
9. Eisenbrand F (1999) On the membership problem for the elementary closure of a polyhedron. Combinatorica 19: 297-300.
10. Eisenbrand F, Rinaldi G, Ventura P (2003) Primal separation for 0/1 polytopes. Mathematical Programming 95: 475-491.
11. Ferreira CE (1994) On Combinatorial Optimization Problems Arising in Computer Systems Design. PhD Thesis, Technische Universität Berlin.
12. Fischetti M, Toth P (1997) A polyhedral approach to the asymmetric travelling salesman problem. Management Science 43: 1520-1536.
13. Garey MR, Johnson DS (1979) Computers and Intractibility: A Guide to the Theory of NPcompleteness. Freeman, San Francisco.
14. Gerards AMH, Schrijver A (1986) Matrices with the Edmonds-Johnson property. Combinatorica 6: 365-379.
15. Grötschel M, Lovász L, Schrijver AJ (1988) Geometric Algorithms and Combinatorial Optimization. Wiley, NewYork.
16. Gu Z, Nemhauser GL, Savelsbergh MWP (1998) Lifted cover inequalities for 0-1 integer programs: computation. INFORMS Journal on Computing 10: 427-437.
17. Letchford AN, LodiA (2003)An augment-and-branch-and-cut framework for mixed 0-1 programming. In: Jünger M, Reinelt G, Rinaldi G (eds) Eureka, you Shrink! (Springer-LNCS 2570). Springer, Berlin Heidelberg NewYork, pp 119-133.
18. Letchford AN, Lodi A (2001) Primal separation algorithms. Technical report, D. E. I. S., University of Bologna, OR/01/5. Unpublished.
19. Letchford AN, Lodi A (2002a) Primal cutting plane algorithms revisited. Mathematical Methods of Operations Research 56: 67-81.
20. Letchford AN, Lodi A (2002b) Polynomial-time separation of simple comb inequalities. In: Cook WJ, SchulzAS (eds) Integer Programming and Combinatorial Optimization-IPCO 2002 (LNCS 2337). Springer, Berlin Heidelberg NewYork, pp 96-111.
21. Nagamochi H, Nishimura K, Ibaraki T (1997) Computing all small cuts in undirected networks. SIAM Journal of Discrete Mathematics 10: 469-481.
22. Nagamochi H, Ono T, Ibaraki T (1994) Implementing an efficient minimum capacity cut algorithm. Mathematical Programming 67: 325-341.
23. Nemhauser GL, Wolsey LA (1988) Integer and Combinatorial Optimization. Wiley, NewYork.
24. Padberg MW (1973) On the facial structure of set packing polyhedra. Mathematical Programming 5: 199-215.
25. Padberg MW, Grötschel M (1985) Polyhedral computations. In: Lawler E, Lenstra, J, RinnooyKan A, Shmoys D (eds) The Traveling Salesman Problem. Wiley, Chichester, pp 307-360.
26. Padberg MW, Hong S (1980) On the symmetric travelling salesman problem: a computational study. Mathematical Programming Study 12: 78-107.
27. Padberg MW, Rao MR (1982) Odd minimum cut-sets and b-matchings. Mathematics of Operations Research 7: 67-80.
28. Padberg MW, Rinaldi G (1991)A branch-and-cut algorithm for the resolution of large-scale symmetric travelling salesman problems. SIAM Review 33: 60-100.
29. Papadimitriou CH, Yannakakis M (1984) The complexity of facets (and some facets of complexity). Journal of Computer and Systems Science 28: 244-259.
30. Schrijver A (1986) Theory of Linear and Integer Programming. Wiley, NewYork.