Funder
National Science Foundation of the USA, Office of Naval Research
Publisher
Springer International Publishing
Reference22 articles.
1. K. Andersen, G. Cornuéjols, and Y. Li., Split closure and intersection cuts. Math. Prog. A, 102, 2005, 451–493.
2. K. Andersen, Q. Louveaux, R. Weismantel, R., L.A. Wolsey, Cutting planes from two rows of a simplex tableau. IPCO 12, Lecture Notes in Computer Science, 4513, Springer, 2007, 1–15.
3. E. Balas, Intersection cuts—a new type of cutting planes for integer programming. Operations Research, 19, 1971, 19–39.
4. E. Balas, Integer programming and convex analysis: intersection cuts from outer polars. Mathematical Programming, 2, 1972, 330–382.
5. E. Balas, Disjunctive Programming: Properties of the Convex Hull of Feasible Points. MSRR No. 348, Carnegie Mellon University, July 1974.