Polyhedral characterization of discrete dynamic programming
Operations Research
A lift-and-project cutting plane algorithm for mixed 0-1 programs
Mathematical Programming: Series A and B
Discrete Applied Mathematics
SIAM Journal on Discrete Mathematics
Packing and partitioning orbitopes
Mathematical Programming: Series A and B
Network Formulations of Mixed-Integer Programs
Mathematics of Operations Research
Symmetric ILP: Coloring and small integers
Discrete Optimization
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
The mixing set with divisible capacities: A simple approach
Operations Research Letters
The maximum k-colorable subgraph problem and orbitopes
Discrete Optimization
An algebraic approach to symmetric extended formulations
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 0.00 |
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. A114(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.