Abstract
There are many examples of optimization problems whose associated polyhedra can be described much nicer, and with way less inequalities, by projections of higher dimensional polyhedra than this would be possible in the original space. However, currently not many general tools to construct such extended formulations are available. In this paper, we develop a framework of polyhedral relations that generalizes inductive constructions of extended formulations via projections, and we particularly elaborate on the special case of reflection relations. The latter ones provide polynomial size extended formulations for several polytopes that can be constructed as convex hulls of the unions of (exponentially) many copies of an input polytope obtained via sequences of reflections at hyperplanes. We demonstrate the use of the framework by deriving small extended formulations for the G-permutahedra of all finite reflection groups G (generalizing both Goeman’s [6] extended formulation of the permutahedron of size O(nlogn) and Ben-Tal and Nemirovski’s [2] extended formulation with O(k) inequalities for the regular 2k-gon) and for Huffman-polytopes (the convex hulls of the weight-vectors of Huffman codes).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajtai, M., Komlós, J., Szemerédi, E.: Sorting in c log n parallel steps. Combinatorica 3(1), 1–19 (1983)
Ben-Tal, A., Nemirovski, A.: On polyhedral approximations of the second-order cone. Math. Oper. Res. 26(2), 193–205 (2001)
Carr, R.D., Konjevod, G.: Polyhedral combinatorics. In: Greenberg, H. (ed.) Tutorials on emerging methodologies and applications in Operations Research, ch. 2, Springer, Heidelberg (2004)
Conforti, M., Cornuéjols, G., Zambelli, G.: Extended formulations in combinatorial optimization. 4OR 8(1), 1–48 (2010)
Fomin, S., Reading, N.: Root systems and generalized associahedra. In: Geometric combinatorics. IAS/Park City Math. Ser., vol. 13, pp. 63–131. AMS, Providence (2007)
Goemans, M.: Smallest compact formulation for the permutahedron, http://www-math.mit.edu/stringgoemans/publ.html
Humphreys, J.E.: Reflection groups and Coxeter groups. Cambridge Studies in Advanced Mathematics, vol. 29. Cambridge University Press, Cambridge (1990)
Kaibel, V., Loos, A.: Branched polyhedral systems. In: Eisenbrand, F., Shepherd, F. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 177–190. Springer, Heidelberg (2010)
Kaibel, V., Pashkovich, K., Theis, D.O.: Symmetry matters for the sizes of extended formulations. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 135–148. Springer, Heidelberg (2010)
Kipp Martin, R., Rardin, R.L., Campbell, B.A.: Polyhedral characterization of discrete dynamic programming. Oper. Res. 38(1), 127–138 (1990)
Nguyen, V.H., Nguyen, T.H., Maurras, J.-F.: On the convex hull of Huffman trees. Electronic Notes in Discrete Mathematics 36, 1009–1016 (2010)
Queyranne, M.: Structure of a simple scheduling polyhedron. Math. Programming 58(2, Ser. A), 263–285 (1993)
Wolsey, L.A.: Personal communication
Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. System Sci. 43(3), 441–466 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaibel, V., Pashkovich, K. (2011). Constructing Extended Formulations from Reflection Relations. In: Günlük, O., Woeginger, G.J. (eds) Integer Programming and Combinatoral Optimization. IPCO 2011. Lecture Notes in Computer Science, vol 6655. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20807-2_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-20807-2_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20806-5
Online ISBN: 978-3-642-20807-2
eBook Packages: Computer ScienceComputer Science (R0)