Covering, Packing and Knapsack Problems
- 1 January 1979
- book chapter
- Published by Elsevier in Annals of Discrete Mathematics
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- On the Complexity of Set Packing PolyhedraPublished by Elsevier ,1977
- Set Partitioning: A surveySIAM Review, 1976
- Almost integral polyhedra related to certain combinatorial optimization problemsLinear Algebra and its Applications, 1976
- On balanced matricesPublished by Springer Nature ,1974
- Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systemsPublished by Springer Nature ,1974
- 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
- Three Problems in Rationing CapitalThe Journal of Business, 1955
- Elementare Theorie der konvexen PolyederCommentarii Mathematici Helvetici, 1934