Packing and partitioning orbitopes

Mathematical Programming

Volumn 114, Issue 1, 2008, Pages 1-36

  Kaibel, Volker ^a   Pfetsch, Marc ^a  

^a ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Integer programming; Lexicographic representatives; Symmetry breaking

Indexed keywords

CONSTRAINT THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING;

LEXICOGRAPHIC REPRESENTATIVES; SYMMETRY BREAKING;

MATRIX ALGEBRA;

EID: 41149099546     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0081-5     Document Type: Article

References (19)

1. Borndörfer R., Ferreira C.E. and Martin A. (1998). Decomposing matrices into blocks. SIAM J. Optim. 9(1): 236-269
2. Borndörfer, R., Grötschel, M., Pfetsch, M.E.: A column-generation approach for line planning in public transport. Transp. Sci. (in press)
3. Campêlo M., Corrêa R. and Frota Y. (2004). Cliques, holes and the vertex coloring polytope. Inform. Process. Lett. 89(4): 159-164
4. Coll P., Marenco J., Méndez Díaz I. and Zabala P. (2002). Facets of the graph coloring polytope. Ann. Oper. Res. 116: 79-90
5. Cornaz, D.: On forests, stable sets and polyhedras associated with clique partitions. Preprint, 2006. Available at www.optimization-online.org
6. Eisenblätter, A.: Frequency assignment in GSM networks: models, heuristics, and lower bounds. Ph.D. thesis, TU Berlin (2001)
7. Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) Principles and Practice of Constraint Programming-CP 2001: 7th International Conference, LNCS 2239, pp. 93-107. Springer, Berlin Heidelberg New York (2001)
8. Figueiredo, R., Barbosa, V., Maculan, N., de Souza, C.: New 0-1 integer formulations of the graph coloring problem. In: Proceedings of XI CLAIO (2002)
9. Garey M.R. and Johnson D.S. (1979). Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York
10. Grötschel M., Lovász L. and Schrijver A. (1993). Geometric algorithms and combinatorial optimization. Algorithms and Combinatorics, vol. 2. Springer, Berlin Heidelberg New York
11. Margot F. (2002). Pruning by isomorphism in branch-and-cut. Math. Programm. 94(1): 71-90
12. Margot F. (2003). Small covering designs by branch-and-cut. Math. Programm. 94(2-3): 207-220
13. Mehrotra A. and Trick M.A. (1996). A column generation approach for graph coloring. Informs J. Comput. 8(4): 344-354
14. Méndez-Díaz, I., Zabala, P.: A polyhedral approach for graph coloring. Electron. Notes Discrete Math. 7 (2001)
15. Méndez-Díaz I. and Zabala P. (2006). A branch-and-cut algorithm for graph coloring. Discrete Appl. Math. 154(5): 826-847
16. Puget J.-F. (2005). Symmetry breaking revisited. Constraints 10(1): 23-46
17. Ramani, A., Aloul, F.A., Markov, I.L., Sakallah, K.A.: Breaking instance-independent symmetries in exact graph coloring. In: Design Automation and Test in Europe Conference, pp. 324-329 (2004)
18. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986). Reprint, 1998
19. Serafini P. and Ukovich W. (1989). A mathematical model for periodic scheduling problems. SIAM J. Discr. Math. 2(4): 550-581