Extended formulations for packing and partitioning orbitopes

Mathematics of Operations Research

Volumn 34, Issue 3, 2009, Pages 686-697

  Faenza, Yuri ^a   Kaibel, Volker ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Polytope; Projection; Shifted column inequalities; Symmetry

Indexed keywords

CONVEX HULL; EXTENDED FORMULATIONS; IMPORTANT OBJECT; INTEGER PROGRAM; POLYTOPE; POLYTOPES; PROJECTION; SHIFTED-COLUMN INEQUALITIES; SYMMETRIC GROUPS; SYMMETRY; SYMMETRY REDUCTION;

TOPOLOGY;

INTEGER PROGRAMMING;

EID: 70349302032     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1090.0392     Document Type: Article

References (15)

1. Balas, E., S. Ceria, G. Cornuéjols. 1993. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Programming, Ser. A 58(3) 295-324.
2. Conforti, M., M. Di Summa, F. Eisenbrand, L. A. Wolsey. Network formulations of mixed integer programs. Math. Oper. Res. 34(1) 194-209.
3. Conforti, M., M. Di Summa, L. A. Wolsey. 2007. The mixing set with flows. SIAM J. Discrete Math. 21(2) 396-407.
4. Conforti, M., B. Gerards, G. Zambelli. 2007. Mixed-integer vertex covers on bipartite graphs. M. Fischetti, D. Williamson, eds. Proc. IPCO XII, Lecture Notes in Computer Science, Vol.4513. Springer-Verlag, New York, 324-336.
5. Kaibel, V., M. Peinhardt, M. E. Pfetsch. 2007. Orbitopal fixing. M. Fischetti, D. Williamson, eds. Proc. IPCO XII, Lecture Notes in Computer Science, Vol.4513. Springer-Verlag, New York, 74-88.
6. Kaibel, V., M. E. Pfetsch. 2008. Packing and partitioning orbitopes. Math. Programming, Ser. A 114(1) 1-36.
7. Linderoth, J., J. Ostrowski, F. Rossi, S. Smriglio. 2007. Orbital branching. M. Fischetti, D. Williamson, eds. Proc. IPCO XII, Lecture Notes in Computer Science, Vol.4513. Springer-Verlag, New York, 106-120.
8. Lovász, L., A. Schrijver. 1991. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1(2) 166-190.
9. Margot, F. 2002. Pruning by isomorphism in branch-and-cut. Math. Programming 94(1) 71-90.
10. Margot, F. 2003. Exploiting orbits in symmetric ILP. Math. Programming 98(1-3) 3-21.
11. Margot, F. 2003. Small covering designs by branch-and-cut. Math. Programming 94(2-3) 207-220.
12. Margot, F. 2007. Symmetric ILP: Coloring and small integers. Discrete Optim. 4(1) 40-62.
13. Martin, R. K., R. L. Rardin, B. A. Campbell, 1990. Polyhedral characterization of discrete dynamic programming. Oper. Res. 38(1) 127-138.
14. Ostrowski, J., J. Linderoth, F. Rossi, S. Smirglio. 2008. Constraint orbital branching. A. Lodi, A. Panconesi, G. Rinaldi, eds. Proc. 13th Integer Programming Combin. Optim. Conf. (IPCO), Lecture Notes in Computer Science, Vol.5035. Springer-Verlag, Berlin, 225-239.
15. Sherali, H. D., W. P. Adams. 1994. A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl. Math. 52(1) 83-106.