Set packing relaxations of some integer programs

Mathematical Programming, Series B

Volumn 88, Issue 3, 2000, Pages 425-450

  Borndörfer, Ralf ^a   Weismantel, Robert ^b  

^a ZUSE INSTITUTE BERLIN   (Germany)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Cutting planes; Integer programming; Polyhedral combinatorics; Set packing

Indexed keywords

EID: 0011010882     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00011381     Document Type: Article

References (30)

1. Balas, E, Pulleyblank, W.R. (1989): The perfectly matchable subgraph polytope of an arbitrary graph. Combinatorica 9, 321-327
2. Barahona, F., Mahjoub, A.R. (1994): Compositions of graphs and polyhedra II: Stable sets. SIAM J. Disc. Math. 7, 359-371
3. Barahona, F., Mahjoub, A.R. (1985): On the cut polytope. Math. Program. 36, 157-173
4. Caprara, A., Fischetti, M (1996): {0, 1/2}-Chvátal-Gomory cuts. Math. Program. 74, 221-235
5. Cheng, E., Cunningham, W.H. (1997): Wheel inequalities for stable set polytopes. Math. Program. 77, 389-421
6. Chopra, S., Rao, M.R. (1994): The steiner tree problem I: Formulations, compositions, and extensions of facets. Math. Program. 64, 209-229
7. Chopra, S., Rao, M.R. (1994): The steiner tree problem II: Properties and classes of facets. Math. Program. 64, 231-246
8. Chvátal, V. (1975): On certain polytopes associated with graphs. J. Comb. Theory 18, 138-154
9. Deza, M., Laurent, M. (1997): Geometry of cuts and metrics. Springer, Berlin
10. Euler, R., Jünger, M., Reinelt, G. (1987): Generalizations of cliques, odd cycles and anticycles and their relation to independence system polyhedra. Math. Oper. Res. 12, 451-462
11. Grötschel, M., Jünger, M., Reinelt, G. (1985): On the acyclic subgraph polytope. Math. Program. 33, 28-42
12. Grötschel, M., Jünger, M., Reinelt, G. (1985): Facets of the linear ordering polytope. Math. Program. 33, 43-60
13. Grötschel, M., Lovász, L., Schrijver, A. (1988): Geometric algorithms and combinatorial optimization. Springer, Berlin
14. Grötschel, M., Wakabayashi, Y. (1990): Facets of the clique partitioning polytope. Math. Program. 47, 367-387
15. Jünger, M. (1985): Polyhedral combinatorics and the acyclic subdigraph problem. Res. and Exposition in Math. 7. Heldermann, Berlin
16. Laurent, M. (1989): A generalization of antiwebs to independence systems and their canonical facets. Math. Program. 45, 97-108
17. Lovász, L., Schrijver, A. (1991): Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1, 166-190
18. Müller, R. (1996): On the partial order polytope of a digraph. Math. Program. 73, 31-49
19. Müller, R., Schulz, A.S. (1995): The interval order polytope of a digraph. In Balas, E., Clausen, J. (eds.), Integer programming and combinatorial optimization 4, Lect. Notes Comput. SCi. 920. Springer, Berlin, pp. 50-64
20. Müller, R., Schulz, A.S. (1996): Transitive packing. In Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds.), Integer programming and combinatorial optimization 5, Lect. Notes Comput. Sci. 1084. Springer, Berlin, pp. 430-444
21. Nemhauser, G.L., Trotter, L.E. (1973): Properties of vertex packing and independence system polyhedra. Math. Program. 6, 48-61
22. Nobili, P., Sassano, A. (1989): Facets and lifting procedures for the set covering polytope. Math. Program. 45, 111-137
23. Padberg, M.W. (1973): On the facial structure of set packing polyhedra. Math. Program. 5, 199-215
24. Padberg, M.W. (1975): A note on zero-one programming. Oper. Res. 23, 833-837
25. Padberg, M.W., Sung, T.-Y. (1991): An analytical comparison of different formulations of the travelling salesman problem. Math. Program. 52, 315-357
26. Pulleyblank, W.R., Shepherd, F.B. (1993): Formulations for the stable set polytope of a claw-free graph. In Rinaldi, G., Wolsey, L.A. (eds.), Integer programming and combinatorial optimization 3. Proc. of the 3rd Int. IPCO Conf., pp. 267-279
27. Reinelt, G. (1985): The linear ordering problem: Algorithms and applications. Res. and Exposition in Math. 8. Heldermann, Berlin
28. Schulz, A.S. (1996): Polytopes and scheduling. PhD thesis, Tech. Univ. Berlin
29. Sekiguchi, Y. (1983): A note on node packing polytopes on hypergraphs. Oper. Res. Lett. 2, 243-247
30. Wakabayashi, Y. (1986): Aggregation of binary relations: Algorithmic and polyhedral investigations. PhD thesis, Univ. Augsburg