Extended Formulations for Packing and Partitioning Orbitopes

References

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