Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference28 articles.
1. Chan, S.O., Lee, J.R., Raghavendra, P., Steurer, D.: Approximate constraint satisfaction requires large LP relaxations. J. ACM 63, 34:1–34:22 (2016)
2. Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Exponential lower bounds for polytopes in combinatorial optimization. J. ACM 62, 17:1–17:23 (2015)
3. Kaibel, V., Pashkovich, K.: Constructing extended formulations from reflection relations. In: Proceedings of 15th IPCO, pp. 287–300 (2011)
4. Rothvoss, T.: The matching polytope has exponential extension complexity. In: Proceedings of 46th STOC, pp. 263–272 (2014)
5. Vielma, J.P.: Small and strong formulations for unions of convex sets from the Cayley embedding. Math. Program. (2018) (To appear)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献