Covering, Packing and Knapsack Problems

This publication has 22 references indexed in Scilit:

• On the Complexity of Set Packing Polyhedra
  Published by Elsevier ,1977
• Set Partitioning: A survey
  SIAM Review, 1976
• Almost integral polyhedra related to certain combinatorial optimization problems
  Linear Algebra and its Applications, 1976
• On balanced matrices
  Published by Springer Nature ,1974
• Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems
  Published by Springer Nature ,1974
• Maximum matching and a polyhedron with 0,1-vertices
  Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
• Paths, Trees, and Flowers
  Canadian Journal of Mathematics, 1965
• Covers and packings in a family of sets
  Bulletin of the American Mathematical Society, 1962
• Three Problems in Rationing Capital
  The Journal of Business, 1955
• Elementare Theorie der konvexen Polyeder
  Commentarii Mathematici Helvetici, 1934