Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference20 articles.
1. On the extension complexity of combinatorial polytopes;Avis,2013
2. Disjunctive Programming: Properties of the Convex Hull of Feasible Points;Balas,1974
3. Approximation limits of linear programs (Beyond Hierarchies);Braun,2012
4. Alfonso Cevallos, Stefan Weltge, Rico Zenklusen, Lifting linear extension complexity bounds to the mixed-integer setting, in: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2018, pp. 788–807.
5. Extended formulations in combinatorial optimization;Conforti;Ann. Oper. Res.,2013