On unions and dominants of polytopes

Mathematical Programming

Volumn 99, Issue 2, 2004, Pages 223-239

  Balas, Egon ^a   Bockmayr, Alexander ^b   Pisaruk, Nicolai ^b   Wolsey, Laurence ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITÉ DE LORRAINE   (France)

^c UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Cardinality constraints; Convex hulls; Dominant; Matroids; Polymatroids; Separation; Unions of polytopes

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; LINEAR PROGRAMMING; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; THEOREM PROVING; VECTORS;

CARDINALITY CONSTRAINTS; CONVEX HULLS; DOMINANT; POLYMATROIDS; UNIONS OF PROTOTYPES;

PROBLEM SOLVING;

EID: 21044448537     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-003-0432-4     Document Type: Article

References (17)

1. Balas, E.: Disjunctive programming: Properties of the convex hull of feasible points. Invited paper with foreword by G. Cornuéjols and W.R. Pulleyblank. Disc. Appl. Math. 89, 1-44 (1998)
2. Balas, E.: Logical Constraints as Cardinality Rules: Tight Representations. #MSRR-628, Carnegie Mellon University, 2000
3. Balas, E., Fischetti, M.: On the monotonization of polyhedra. Math. Program. 78, 59-84 (1997)
4. Boyd, S.C., Pulleyblank, W.R.: Facet generating techniques, Department of Combinatorics and Optimization. University of Waterloo, 1991
5. Conforti, M., Laurent, M.: On the facial structure of independence system polyhedra. Math. Oper. Res. 13, 543-555 (1988)
6. Cunningham, W.H.: Testing membership in matroid polyhedra. J. Combin. Theory B 36, 161-188 (1984)
7. Cunningham, W.H.: On submodular function minimization. Combinatorica 5, 185-192 (1985)
8. Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R., Hanani, H., Sauer, N., Schönheim, J., eds. Combinatorial Structures and their applications, Gordon and Breach, New York, 1970, pp. 69-87
9. Edmonds, J.: Matroids and the Greedy Algorithm. Math. Program. 1, 127-136 (1971)
10. Edmonds, J., Fulkerson, D.R.: Transversals and matroid partition. J. Res. Nat. Bur. Standards 69B, 147-153 (1965)
11. Fulkerson, D.R.: Blocking and Antiblocking Pairs of Polyhedra. Math. Program. 1, 168-194 (1971)
12. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer Verlag 1988
13. Hong, Y., Hooker, J.N.: Tight representation of logical constraints as cardinality rules. Math. Program. 85, 363-377 (1999)
14. Iwata, S., Fleisher, L., Fujishige, S.: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. J. ACM 48, 761-777 (2001)
15. Padberg, M.W.: (1, k)-Configurations and facets for packing problems. Math. Program. 18, 94-99 (1980)
16. Rockafellar, T.: Convex analysis. Princeton University Press, 1970
17. Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combinatorial Theory, Ser. B 80, 346-355 (2000)