On the Complexity of Set Packing Polyhedra
- 1 January 1977
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Facets of the knapsack polytopeMathematical Programming, 1975
- Properties of vertex packing and independence system polyhedraMathematical Programming, 1974
- Perfect zero–one matricesMathematical Programming, 1974
- On the facial structure of set packing polyhedraMathematical Programming, 1973
- Canonical Cuts on the Unit HypercubeSIAM Journal on Applied Mathematics, 1972
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- Covers and packings in a family of setsBulletin of the American Mathematical Society, 1962
- Elementare Theorie der konvexen PolyederCommentarii Mathematici Helvetici, 1934