A recursive procedure to generate all cuts for 0–1 mixed integer programs

1990/01/01 by George L. Nemhauser, Laurence A. Wolsey · 2 citations
Computer Science · Mathematics · #Formal Methods in Verification #Complexity and Algorithms in Graphs #Commutative Algebra and Its Applications

paper · doi:10.1007/bf01585752

Citations

• Cutting-plane theory: Algebraic methods

Cited by

• Branch and Bound in Mixed Integer Linear Programming Problems: A Survey of Techniques and Trends
• On the split closure of the periodic timetabling polytope