Branched polyhedral systems

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

Volumn 6080 LNCS, Issue , 2010, Pages 177-190

  Kaibel, Volker ^a   Loos, Andreas ^a  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CAMPBELL; COMBINATORIAL OPTIMIZATION PROBLEMS; COMBINATORIAL PROBLEM; CONVEX HULL; DISJUNCTIVE PROGRAMMING; DYNAMIC PROGRAMMING ALGORITHM; EXTENDED FORMULATIONS; MATCHING PROBLEMS; POLYTOPES; STABLE SETS;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL GEOMETRY; INTEGER PROGRAMMING; TOPOLOGY;

DYNAMIC PROGRAMMING;

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

References (12)

1. Balas, E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discrete Methods 6(3), 466-486 (1985)
2. Conforti, M., Cornuéjols, G., Zambelli, G.: Extended Formulations in Combinatorial Optimization. Technical Report (2009)
3. Conforti, M., Cornuéjols, G., Zambelli, G.: Polyhedral approaches to mixed integer linear programming. In: Jünger, M., Liebling, T., Naddef, D., Nemhauser, G., Pulleyblank, W., Reinelt, G., Rinaldi, G., Wolsey, L. (eds.) 50 Years of Integer Programming 1958-2008. Springer, Heidelberg (2010)
4. Conforti, M., Di Summa, M., Eisenbrand, F., Wolsey, L.: Network formulations of mixed-integer programs. Math. Oper. Res. 34, 194-209 (2009)
5. Edmonds, J.: Maximum matching and a polyhedron with 0, 1 vertices. Journal of Research of the National Bureau of Standards 69B, 125-130 (1965)
6. Faenza, Y., Kaibel, V.: Extended formulations for packing and partitioning orbitopes. Math. Oper. Res. 34(3), 686-697 (2009)
7. Faenza, Y., Oriolo, G., Stauffer, G.: The hidden matching structure of the composition of strips: a polyhedral perspective. In: 14th Aussois Workshop on Combinatorial Optimization, Aussois (January 2010)
8. Kaibel, V., Pashkovich, K., Theis, D.O.: Symmetry matters for the sizes of extended formulations. In: Eisenbrand, F., Shepherd, B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 135-148. Springer, Heidelberg (2010)
9. Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Math. Program. 114(1, Ser. A), 1-36 (2008)
10. Margot, F.: Composition de Polytopes Combinatoires: Une Approche par Projection. Ph.D. thesis, École Polytechnique Fédérale de Lausanne (1994)
11. Martin, R.K., Rardin, R.L., Campbell, B.A.: Polyhedral characterization of discrete dynamic programming. Oper. Res. 38(1), 127-138 (1990)
12. Schaffers, M.: On Links Between Graphs with Bounded Decomposability, Existence of Efficient Algorithms, and Existence of Polyhedral Characterizations. Ph.D. thesis, Université Catholique de Louvain (1994)