Branch and bound experiments in zero-one programming

This publication has 15 references indexed in Scilit:

• Enumerative Cuts: I
  Operations Research, 1973
• Integer programming and convex analysis: Intersection cuts from outer polars
  Mathematical Programming, 1972
• Experiments in mixed-integer linear programming
  Mathematical Programming, 1971
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
  Operations Research, 1971
• An Improved Implicit Enumeration Approach for Integer Programming
  Operations Research, 1969
• Surrogate Constraints
  Operations Research, 1968
• Discrete Programming by the Filter Method
  Operations Research, 1967
• Branch-and-Bound Methods: A Survey
  Operations Research, 1966
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
  Operations Research, 1965
• An Automatic Method of Solving Discrete Programming Problems
  Econometrica, 1960