Symmetry matters for the sizes of extended formulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6080 LNCS, Issue , 2010, Pages 135-148

  Kaibel, Volker ^a   Pashkovich, Kanstantsin ^a   Theis, Dirk Oliver ^a  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETE GRAPHS; EXTENDED FORMULATIONS; MATCHINGS; POLYNOMIAL SIZE; POLYTOPES;

COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; GRAPH THEORY;

INTEGER PROGRAMMING;

EID: 77954394538     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13036-6_11     Document Type: Conference Paper

References (17)

1. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. Assoc. Comput. Mach. 42(4), 844-856 (1995)
2. Balas, E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discrete Methods 6(3), 466-486 (1985)
3. Bochert, A.: Ueber die Zahl der verschiedenen Werthe, die eine Function gegebener Buchstaben durch Vertauschung derselben erlangen kann. Math. Ann. 33(4), 584-590 (1889)
4. Bruglieri, M., Ehrgott, M., Hamacher, H.W., Maffioli, F.: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. Discrete Appl. Math. 154(9), 1344-1357 (2006)
5. Conforti, M., Cornuéjols, G., Zambelli, G.: Extended formulations in combinatorial optimization. Tech. Rep., Università di Padova (2009)
6. Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Nat. Bur. Standards Sect. B 69B, 125-130 (1965)
7. Edmonds, J.: Matroids and the greedy algorithm. Math. Programming 1, 127-136 (1971)
8. Fredman, M.L., Komlós, J., Szemerédi, E.: Storing a sparse table with O(1) worst case access time. J. Assoc. Comput. Mach. 31(3), 538-544 (1984)
9. Goemans, M.: Smallest compact formulation for the permutahedron, http://www-math.mit.edu/~goemans/publ.html
10. Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Indust. Appl. Math. 10, 196-210 (1962)
11. Kaibel, V., Loos, A.: Branched polyhedral systems. In: Eisenbrand, F., Shepherd, B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 177-190. Springer, Heidelberg (2010)
12. Kaibel, V., Pashkovich, K., Theis, D.O.: Symmetry matters for the sizes of extended formulations. arXiv:0911.3712v1 [math.CO]
13. Kipp Martin, R.: Using separation algorithms to generate mixed integer model reformulations. Tech. Rep., University of Chicago (1987)
14. Pashkovich, K.: Tight lower bounds on the sizes of symmetric extensions of permutahedra and similar results (in preparation)
15. Schmidt, J.P., Siegel, A.: The spatial complexity of oblivious k-probe hash functions. SIAM J. Comput. 19(5), 775-786 (1990)
16. Wielandt, H.: Finite permutation groups. Translated from the German by Bercov, R. Academic Press, New York (1964)
17. Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. System Sci. 43(3), 441-466 (1991)