@article{Faenza:181874,
title = {Extended Formulations for Packing and Partitioning Orbitopes},
author = {Faenza, Y. and Kaibel, V.},
journal = {Mathematics of Operations Research},
number = {3},
volume = {34},
pages = {686-697},
year = {2009},
abstract = {We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in Kaibel and Pfetsch [Kaibel, V., M. E. Pfetsch. 2008. Packing and partitioning orbitopes. Math. Programming, Ser. A 114(1) 1–36]. These polytopes are the convex hulls of all 0/1-matrices with lexicographically sorted columns and at most, respectively, exactly one 1-entry per row. They are important objects for symmetry reduction in certain integer programs. Using the extended formulations, we also derive a rather simple proof of the fact established in the paper mentioned above, that basically shifted-column inequalities suffice to describe those orbitopes linearly.},
url = {http://infoscience.epfl.ch/record/181874},
doi = {10.1287/moor.1090.0392},
}