Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference26 articles.
1. E. Balas, “The intersection cut — A new cutting plane for integer programming”,Operations Research, 19 (1970) 19–39.
2. E. Balas, “Integer programming and convex analysis: Intersection cuts from outer polars”,Mathematical Programming 2 (3) (1972) 330–382.
3. E. Balas, “On the use of intersection cuts in branch and bound”, paper presented at the 8th International Symposium on Mathematical Programming, Stanford, August 1973.
4. E. Balas, “Disjunctive programming: Properties of the convex hull of feasible points”, Management Science Research Rept. No. 348, Carnegie-Mellon University (July 1974).
5. C.-A. Burdet, “Enumerative cuts: I”,Operations Research 21 (1) (1973) 61–89.
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Degeneracy removal in cutting plane methods for disjoint bilinear programming;Optimization Letters;2016-02-15
2. Integer Programming;Wiley StatsRef: Statistics Reference Online;2014-09-29
3. Optimality Conditions for Disjunctive Optimization in Reflexive Banach Spaces;Journal of Optimization Theory and Applications;2014-05-06
4. A class of multi-level balanced Foundation-Penalty cuts for mixed-integer programs;International Journal of Computational Science and Engineering;2007
5. Integer Programming;Encyclopedia of Statistical Sciences;2006-08-15