0/1 optimization and 0/1 primal separation are equivalent

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 920-926

  Eisenbrand, Friedrich ^a   Rinaldi, Giovanni ^b   Ventura, Paolo ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b Istituto di Analisi dei Sistemi ed   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; TREES (MATHEMATICS);

EXTREME POINTS; FLOW COMPUTATION; ITS STANDARDS; PERFECT MATCHINGS; POLYNOMIAL-TIME; SEPARATION METHODS; SEPARATION PROBLEMS; SEPARATION VARIANTS;

OPTIMIZATION;

EID: 15244350927     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. A. V. Ano, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, 1974.
2. J. Edmonds. Maximum matching and a polyhedron with 0, 1-vertices. Journal of Research of the National Bureau of Standards, 69:125-130, 1965.
3. J. Edmonds. Paths, trees and flowers. Canadian Journal of Mathematics, 17:449-467, 1965.
4. J. Edmonds and E. L. Johnson. Matching, Euler tours and the Chinese postman. Mathematical Programming, 5:88-124, 1973.
5. F. Eisenbrand, G. Rinaldi, and P. Ventura. Primal separation for 0/1 polytopes. IASI-CNR Research Report 546, Istituto di Analisi dei Sistemi ed Informática, Roma, Italy, 2001.
6. R. T. Firla, B. Spille, and R. Weismantel. A primal analogue of cutting plane algorithms. Technical report, Fakultät fur Mathematik, Otto-von-Guericke-Universitätt Magdeburg, Germany, 1999.
7. A. Frank and É. Tardos. An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica, 7:49-65, 1987.
8. A. M. H. Gerards. Matching. In M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, editors, Network models, volume 7 of Handbooks in Operations Research and Management Science, pages 135-224. North-Holland, Amsterdam, 1995.
9. R. E. Gomory and T. C Hu. Multi-terminal network flows. Journal of the Society of Industrial Applied Mathematics, 9:551-570, 1961.
10. M. Grötschel and L. Lovász. Combinatorial optimization. In R. Graham, M. Grötschel, and L. Lovasz, editors, Handbook of Combinatorics, volume 2, chapter 28, pages 1541-1597. North Holland, 1995.
11. M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1(2):169-197, 1981.
12. R. M. Karp and C. H, Papadimitriou. On linear characterizations of combinatorial optimization problems. In 21st Annual Symposium on Foundations of Computer Science (Syracuse, N.Y., 1980), pages 1-9. IEEE, New York, 1980.
13. A. N. Letchford and A. Lodi. Primal cutting plane algorithms revisited. Technical report, Department of Management Science, Lancaster University, 2001.
14. A-N. Letchford and A. Lodi. Primal separation algorithms. Technical report, Department of Management Science, Lancaster University, 2001.
15. M. W. Padberg and M. Grötschel. Polyhedral computations. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, and D. B. Shmoys, editors, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pages 307-360. John Wiley & Sons, 1985.
16. M. W. Padberg and S. Hong. On the symmetric travelling salesman problem: a computational study. Mathematical Programming Study, 12:78-107, 1980.
17. M. W. Padberg and M. R. Rao. The russian method for linear programming III: Bounded integer programming. Technical Report 81-39, New York University, Graduate School of Business and Administration, 1981.
18. M. W. Padberg and M. R. Rao. Odd minimum cut-sets and b-matchings. Mathematics of Operations Research, 7:67-80, 1982.
19. W. R. Pulleyblank. Faces of Matching Polyhedra. PhD thesis, University of Waterloo, 1973.
20. A. Schrijver. Theory of Linear and Integer Programming. John Wiley, 1986.
21. A. S. Schulz, R. Weismantel, and G. M. Ziegler. 0/1-integer programming: Optimization and augmentation are equivalent. In ESA '95 Lecture Notes in Computer Science, number 979 in LNCS, pages 473-483. Springer, 1995.
22. W. T. Tutte. A short proof of the factor theorem for finite graphs. Canadian J. Math., 6:347-352, 1954.
23. R. D. Young. A simplified primal (all-integer) integer programming algorithm. Operations Res., 16:750-782, 1968.
24. Günter M. Ziegler. Lectures on 0/1-polytopes. In Polytopes-combinatorics and computation (Oberwolfach, 1997), pages 1-41. Birkhäuser, Basel, 2000.