Automatic generation of symmetry-breaking constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5165 LNCS, Issue , 2008, Pages 328-338

  Liberti, Leo ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION;

AUTOMATIC GENERATION; COMPUTATIONAL RESULTS; INTEGER LINEAR PROGRAMS; PERMUTATION GROUP; SOLUTION PROCESS; SYMMETRY BREAKING CONSTRAINTS;

INTEGER PROGRAMMING;

EID: 51849085158     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85097-7_31     Document Type: Conference Paper

References (22)

1. Bell, D.: Constructive group relaxations for integer programs. SIAM Journal on Applied Mathematics 30(4), 708-719 (1976)
2. Boulle, M.: Compact mathematical formulation for graph partitioning. Optimization and Engineering 5, 315-333 (2004)
3. Cohen, D., Jeavons, P., Jefferson, C., Petrie, K., Smith, B.: Symmetry definitions for constraint satisfaction problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 17-31. Springer, Heidelberg (2005)
4. Fourer, R., Gay, D.: The AMPL Book. Duxbury Press, Pacific Grove (2002)
5. Friedman, E.J.: Fundamental domains for integer programs with symmetries. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol. 4616, pp. 146-153. Springer, Heidelberg (2007)
6. The GAP Group. GAP - Groups, Algorithms, and Programming, Version 4.4.10 (2007)
7. Gomory, R.: Some polyhedra related to combinatorial problems. Linear Algebra and Its Applications 2(4), 451-558 (1969)
8. ILOG. ILOG CPLEX 10.1 User's Manual. ILOG S.A., Gentilly, France (2006)
9. Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Mathematical Programming (to appear)
10. Lee, J.: All-different polytopes. Journal of Combinatorial Optimization 6, 335-352 (2002)
11. Lee, J., Margot, F.: On a binary-encoded ILP coloring formulation. INFORMS Journal on Computing 19(3), 406-415 (2007)
12. Liberti, L.: Reformulation techniques in mathematical programming, Thèse d'Habilitation a Diriger des Recherches (November 2007)
13. Liberti, L.: Reformulations in mathematical programming: Definitions. In: Ar-inghieri, R., Cordone, R., Righini, G. (eds.) Proceedings of the 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Crema, Università Statale di Milano (2008)
14. Margot, F.: Pruning by isomorphism in branch-and-cut. Mathematical Programming 94, 71-90 (2002)
15. Margot, F.: Exploiting orbits in symmetric ILP. Mathematical Programming B 98, 3-21 (2003)
16. Margot, F.: Small covering designs by branch-and-cut. Mathematical Programming B 94, 207-220 (2003)
17. Margot, F.: Symmetric ILP: coloring and small integers. Discrete Optimization 4, 40-62 (2007)
18. Martin, A., Achterberg, T., Koch, T.: MIPLIB 2003. A library of pure and mixed-Integer programs (2003)
19. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
20. Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 104-118. Springer, Heidelberg (2007)
21. Sherali, H., Smith, C.: Improving discrete model representations via symmetry considerations. Management Science 47(10), 1396-1407 (2001)
22. Wolsey, L.: Group representation theory in integer programming. Technical Report Op. Res. Center 41, MIT (1969)