Set Partitioning

This publication has 26 references indexed in Scilit:

• The Generalized Lattice-Point Problem
  Operations Research, 1973
• On the Set-Covering Problem
  Operations Research, 1972
• Balanced matrices
  Mathematical Programming, 1972
• Blocking and anti-blocking pairs of polyhedra
  Mathematical Programming, 1971
• The Set-Partitioning Problem: Set Covering with Equality Constraints
  Operations Research, 1969
• Integer Programming by Implicit Enumeration and Balas’ Method
  SIAM Review, 1967
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
  Operations Research, 1965
• Multistage Cutting Stock Problems of Two and More Dimensions
  Operations Research, 1965
• 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
• TWO THEOREMS IN GRAPH THEORY
  Proceedings of the National Academy of Sciences, 1957