1. Avis, D., Tiwary, H.R.: On the extension complexity of combinatorial polytopes. Math. Program. 153(1), 95–115 (2015)
2. Balas, E.: Disjunctive programming. In: Hammer, P., Johnson, E., Korte, B. (eds.) Discrete Optimization II, Annals of Discrete Mathematics, vol. 5, pp. 3–51. Elsevier, Amsterdam (1979)
3. Barvinok, A.: A Course in Convexity, Graduate Studies in Mathematics, vol. 54. American Mathematical Society, Providence (2002)
4. Briët, J., Dadush, D., Pokutta, S.: On the existence of 0/1 polytopes with high semidefinite extension complexity. Math. Program. 153(1), 179–199 (2015)
5. Conforti, M., Cornuéjols, G., Zambelli, G.: Extended formulations in combinatorial optimization. Ann. Oper. Res. 204(1), 97–143 (2013)