Blocking and Antiblocking Polyhedra

This paper describes the fundamental aspects of the theory of blocking and antiblocking polyhedra as developed by D.R. Fulkerson. The theory is an excellent framework for a joint consideration of a class of continuous problems and a class of combinatorial problems, and it unifies several notions that are similar for both classes of problems. The present paper presents shortly some of the many examples of this sort together with several references to related works.

[1]  D. R. Fulkerson,et al.  Packing rooted directed cuts in a weighted directed graph , 1974, Math. Program..

[2]  W. H. Cunningham,et al.  An Unbounded Matroid Intersection Polyhedron , 1977 .

[3]  V. Chvátal.  On certain polytopes associated with graphs , 1975 .

[4]  Jørgen Tind.  Blocking and antiblocking sets , 1974, Math. Program..

[5]  J. Edmonds,et al.  A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[6]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[7]  Manfred W. Padberg,et al.  Perfect zero–one matrices , 1974, Math. Program..

[8]  David B. Weinberger,et al.  Network Flows, Minimum Coverings, and the Four-Color Conjectures , 1976, Oper. Res..

[9]  David B. Weinberger,et al.  Transversal matroid intersections and related packings , 1976, Math. Program..

[10]  D. R. Fulkerson,et al.  Anti-blocking polyhedra , 1972 .

[11]  Elementary vectors and two polyhedral relaxations , 1978 .

[12]  D. R. Fulkerson.  On the Perfect Graph Theorem , 1973 .

[13]  Bernard Harris,et al.  Graph theory and its applications , 1970 .

[14]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[15]  M. Padberg.  Almost integral polyhedra related to certain combinatorial optimization problems , 1976 .

[16]  K. Mani Chandy,et al.  Computer performance : proceedings of the International Symposium on Computer Performance Modeling, Measurement, and Evaluation, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, August 16-18, 1977 , 1977 .

[17]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[18]  J. Tind.  On Antiblocking Sets and Polyhedra , 1977 .

[19]  László Lovász,et al.  Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[20]  D. R. Fulkerson,et al.  Blocking Pairs of Polyhedra Arising from Network Flows , 1975 .

[21]  A. C. Williams.  Nonlinear Activity Analysis , 1970 .

[22]  L. Lovász.  A Characterization of Perfect Graphs , 1972 .

[23]  László Lovász,et al.  Certain Duality Principles in Integer Programming , 1977 .