Smallest compact formulation for the permutahedron

Mathematical Programming

Volumn 153, Issue 1, 2015, Pages 5-11

  Goemans, Michel X ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Compact formulations; Extended formulations; Permutahedron; Sorting networks

Indexed keywords

MATHEMATICAL PROGRAMMING;

COMPACT FORMULATIONS; CONVEX HULL; EXTENDED FORMULATIONS; MULTIPLICATIVE CONSTANTS; PERMUTAHEDRON; POLYTOPES; SORTING NETWORK;

SOFTWARE ENGINEERING;

EID: 84941996511     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-014-0757-1     Document Type: Article

References (12)

1. Ajtai, M., Komlós, J., Szemerédi, E.: Sorting in $$C \log N$$ClogN parallel steps. Combinatorica 3, 1–19 (1983)
2. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms (2001)
3. Conforti, M., Cornuéjols, G., Zambelli, G.: Extended formulations in combinatorial optimization. 4OR 8, 1–48 (2010)
4. Fiorini, S., Kaibel, V., Pashkovich, K., Theis, D.O.: Combinatorial bounds on nonnegative rank and extended formulations. arxiv:1111.0444 (2012)
5. Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. In: Proceedings of the 44th ACM Symposium on Theory of Computing (STOC 2012) (2012)
6. Kaibel, V.: Extended formulations in combinatorial optimization. Optima 85, 2–7 (2011)
7. Pashkovich, K.: Tight lower bounds on the sizes of symmetric extensions of permutahedra and similar results. arxiv:0912.3446 (2009)
8. Paterson, M.S.: Improved sorting networks with $$O(\log N)$$O(logN) depth. Algorithmica 5, 75–92 (1990)
9. Rado, R.: An inequality. J. Lond. Math. Soc. 27, 1–6 (1952)
10. Rothvoß, T.: Some $$0/1$$0/1 polytopes need exponential size extended formulations. Math. Program. (2012)
11. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)
12. Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci. 43, 441–466 (1991)