Author:
Conforti Michele,Cornuéjols Gérard,Zambelli Giacomo
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference62 articles.
1. Ajtai, M., Komlós, J., & Szemerédi, E. (1983). An O(nlogn) sorting network. In Proceedings of the 15th annual ACM symposium on theory of computing (pp. 1–9).
2. Alon, N., Yuster, R., & Zwick, U. (1995). Color-coding. Journal of the ACM, 42, 844–856.
3. Avis, D., & Fukuda, K. (1992). A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete & Computational Geometry, 8, 295–313.
4. Balas, E. (1974). Disjunctive programming: properties of the convex hull of feasible points (GSIA Management Science Research Report MSRR 348). Carnegie Mellon University. Published as invited paper in Discrete Applied Mathematics, 89, 3–44 (1998).
5. Balas, E. (1985). Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM Journal on Algebraic and Discrete Methods, 6, 466–486.
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献