Primal separation for 0/1 polytopes

Mathematical Programming, Series B

Volumn 95, Issue 3, 2003, Pages 475-491

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

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS;

BIPARTITE GRAPH; POLYNOMIAL TIME; SEPARATION PROBLEM;

PROBLEM SOLVING;

EID: 33751109270     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-002-0309-y     Document Type: Article

References (35)

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, 1974
2. Ahuja, R.K., Magnanti, T.L., Orlin. J.B.: Network Flows. Prentice Hall Inc., Englewood Cliffs, NJ, Theory, algorithms, and applications, 1993
3. Barahona, F., Mahjoub, A.R.: On the cut polytope. Math. Program. 36(2), 157-173 (1986)
4. Chvatal, V.: On certain polytopes associated with graphs. J. Combinatorial Theory Ser. B 18, 138-154 (1975)
5. De Simone, C., Rinaldi, G.: A cutting plane algorithm for the max-cut problem. Optim. Meth. Software 3, 195-214 (1994)
6. Deza, M.M., Laurent, M.: Geometry of Cuts and Metrics. Springer-Verlag, Berlin, 1997
7. Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. National Bureau of Standards 69, 125-130 (1965a)
8. Edmonds, J.: Paths, trees and flowers. Canadian J. Math. 17, 449-467 (1965b)
9. Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese postman. Math. Program. 5, 88-124 (1973)
10. Firla, R.T., Spille, B., Weismantel, R.: A primal analogue of cutting plane algorithms, Technical report, Fakultät für Mathematik, Otto-von-Guericke-Universitätt Magdeburg, Germany, 1999
11. Frank, A., Tardos, É.: An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica 7, 49-65 (1987)
12. Gerards, A.M.H.: Testing the odd bicycle wheel inequalities for the bipartite subgraph polytope. Math. Oper. Res. 10(2), 359-360 (1985)
13. Gerards, A.M.H.: Matching. In: M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (eds), Network Models, Vol. 7 of Handbooks in Operations Research and Management Science, North-Holland, Amsterdam, pp. 135-224, 1995.
14. Gerards, A.M.H., Schrijver, A.: Matrices with the Edmonds-Johnson property. Combinatorica 6, 365-379 (1986)
15. Grötschel, M., Lovász, L.: Combinatorial optimization. In: R. Graham, M. Grötschel, L. Lovász (eds), Handbook of Combinatorics, Vol. 2, North Holland, chapter 28, pp. 1541-1597, 1995
16. Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169-197 (1981)
17. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, Vol. 2 of Algorithms and Combinatorics, Springer, 1988
18. Grötschel, M., Pulleyblank, W.R.: Weakly bipartite graphs and the max-cut problem. Oper. Res. Lett. 1(1), 23-27 (1981/82)
19. Gusfield, D.: Very simple methods for all pairs network flow analysis. SIAM J. Comput. 19(1), 143-155 (1990)
20. Karp, R.M., Papadimitriou, C.H.: On linear characterizations of combinatorial optimization problems. In: 21st Annual Symposium on Foundations of Computer Science (Syracuse, N. Y., 1980), IEEE, New York, pp. 1-9, 1980
21. Letchford, A.N., Lodi, A.: Primal cutting plane algorithms revisited. Technical report, Department of Management Science, Lancaster University, 2001a
22. Letchford, A.N., Lodi, A.: Primal separation algorithms. Technical report, Department of Management Science, Lancaster University, 2001b
23. Letchford, A.N., Lodi, A.: Polynomial-time separation of simple comb inequalities. In: Proc. 9-th Conf. Integer Programming and Combinatorial Optim. (2002), to appear
24. Padberg, M., Rinaldi, G.: Facet identification for the symmetric traveling salesman polytope. Math. Program. 47(2, (Ser. A)), 219-257 (1990)
25. Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review 33(1), 60-100 (1991)
26. Padberg, M.W., Grötschel, M.: Polyhedral computations. In E.L. Lawler, J.K. Lenstra, A. Rinnoy Kan, D.B. Shmoys (eds), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley & Sons, pp. 307-360 1985
27. Padberg, M.W., Hong. S.: On the symmetric travelling salesman problem: a computational study. Math. Program. Study 12, 78-107 (1980)
28. Padberg, M.W., Rao, M.R.: The russian method for linear programming III: Bounded integer programming. Technical Report 81-39, New York University, Graduate School of Business and Administration, 1981
29. Padberg, M.W., Rao, M.R.: Odd minimum cut-sets and i-matchings. Math. Oper. Res. 7, 67-80 (1982)
30. Pulleyblank, W.R.: Faces of Matching Polyhedra. PhD thesis. University of Waterloo, 1973
31. Schrijver, A.: Theory of Linear and Integer Programming. John Wiley, 1986
32. Schulz, A.S., Weismantel, R., Ziegler, G.M.: 0/1-integer programming: Optimization and augmentation are equivalent. In: ESA '95 Lecture Notes in Computer Science, number 979 in LNCS, Springer, pp. 473-483 1995
33. Tutte, W.T.: A short proof of the factor theorem for finite graphs. Canadian J. Math. 6, 347-352 (1954)
34. Young, R.D.: A simplified primal (all-integer) integer programming algorithm. Oper. Res. 16, 750-782 (1968)
35. Ziegler, G.M.: Lectures on 0/1 -polytopes. In: Polytopes - combinatorics and computation (Oberwolfach, 1997), Birkhäuser, Basel, pp. 1-41. 2000