Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. E. Balas, “Intersection cuts—A new type of cutting planes for integer programming”, Operations Research 19 (1971) 19–39.
2. Management Sciences Report;C. Burdet,1972
3. G.B. Dantzig, Linear programming and extensions (Princeton University Press, Princeton, N.J., 1962).
4. F. Glover, “Cut search methods in integer programming”, Mathematical Programming 3 (1972) 86–100.
5. R.E. Gomory, “Some polyhedra related to combinatorial problems”, Linear Algebra and Its Applications 2 (1969) 451–558.
Cited by
83 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献