Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference25 articles.
1. Applegate, D. L., Bixby, R. E., Chvátal, V., & Cook, W. J. (2006). The traveling salesman problem: A computational study (2nd ed.). Princeton: Princeton University Press.
2. Balas, E. (1997). A modified lift-and-project procedure. Mathematical Programming, 79(1–3), 19–31.
3. Balas, E. (1998). Disjunctive programming: Properties of the convex hull of feasible points. Discrete Applied Mathematics, 89(1–3), 3–44.
4. Balas, E., & Bonami, P. (2009). Generating lift-and-project cuts from the lp simplex tableau: open source implementation and testing of new variants. Mathematical Programming Computation, 1(2–3), 165–199.
5. Balas, E., & Perregaard, M. (2002). Lift-and-project for mixed 0–1 programming: Recent progress. Discrete Applied Mathematics, 123, 129–154.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献