Reformulations in mathematical programming: Automatic symmetry detection and exploitation

Mathematical Programming

Volumn 131, Issue 1-2, 2012, Pages 273-304

  Liberti, Leo ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Branch and bound; Group; Mixed integer nonlinear programming; Symmetry

Indexed keywords

BRANCH AND BOUNDS; BRANCH-AND-BOUND CODES; COMPUTATIONAL RESULTS; GROUP; LINEAR PROGRAMS; MATHEMATICAL PROGRAM; MIXED INTEGER NONLINEAR PROGRAM; MIXED-INTEGER NONLINEAR PROGRAMMING; NONLINEAR PROGRAMS; SEARCH TREES; SYMMETRY BREAKING CONSTRAINTS; SYMMETRY DETECTION;

CRYSTAL SYMMETRY; LIBRARIES; LINEAR PROGRAMMING;

INTEGER PROGRAMMING;

EID: 78149247885     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0351-0     Document Type: Article

References (55)

1. F.A. Al-Khayyal H.D. Sherali 2000 On finitely terminating branch-and-bound algorithms for some global optimization problems SIAM J. Optim. 10 4 1049 1057 1777079 0994.65068 10.1137/S105262349935178X
2. Babai L.: Automorphism groups, isomorphism, reconstruction. In: Graham, R.; Grötschel, M.; Lovász, L. (eds) Handbook of Combinatorics, vol. 2, pp. 1447-1540. MIT Press, Cambridge (1996)
3. C. Bauer A. Frink R. Kreckel 2002 Introduction to the GiNaC framework for symbolic computation within the C++ programming language J. Symb. Comput. 33 1 1 12 1876308 1017.68163 10.1006/jsco.2001.0494
4. P. Belotti J. Lee L. Liberti F. Margot A. Wächter 2009 Branching and bounds tightening techniques for non-convex MINLP Optim. Methods Softw. 24 4 597 634 2554902 1179.90237 10.1080/10556780903087124
5. Berthold, T.; Pfetsch, M.: Detecting orbitopal symmetries. In: Fleischmann, B.; Borgwardt, K.-H.; Klein, R.; Tuma, A. (eds.) Operations Research Proceedings 2008, pp. 433-438. Springer, Berlin (2009)
6. Bixby, R.; Ceria, S.; McZeal, C.; Savelsbergh, M.: An updated mixed integer programming library: Miplib 3. Technical Report TR98-03, Rice University (1998)
7. Booth, K.; Colbourn, C.: Problems polynomially equivalent to graph isomorphism. Technical Report CS-77-04, University of Waterloo (1979)
8. M. Boulle 2004 Compact mathematical formulation for graph partitioning Optim. Eng. 5 315 333 2092878 1151.90522 10.1023/B:OPTE.0000038889.84284.c7
9. M. Bruglieri L. Liberti 2008 Optimal running and planning of a biomass-based energy production process Energy Policy 36 2430 2438 10.1016/j.enpol.2008.01.009
10. Bussieck, M.: Globallib-a collection of nonlinear programming problems. http://www.gamsworld.org/global/globallib.htm (2004)
11. Bussieck, M.; Drud, A.; Meeraus, A.: MINLPLib-A collection of test models for mixed-integer nonlinear programming. Inf. J. Comput. 15(1) (2003)
12. Butler, G.: Fundamental Algorithms for Permutation Groups, LNCS, vol. 559. Springer (1991)
13. Cohen, D.; Jeavons, P.; Jefferson, C.; Petrie, K.; Smith, B.: Symmetry definitions for constraint satisfaction problems. In: van Beek, P. (ed.) CP, LNCS, vol. 3709. Springer (2005)
14. Cohen J.S.: Computer Algebra and Symbolic Computation: Mathematical Methods. AK Peters, Natick, MA (2000)
15. Cohen J.S.: Computer Algebra and Symbolic Computation: Elementary Algorithms. AK Peters, Natick, MA (2002)
16. Y. Faenza V. Kaibel 2009 Extended formulations for packing and partitioning orbitopes Math. Oper. Res. 34 3 686 697 2555343 1218.90124 10.1287/moor.1090.0392
17. Fischetti, M.; Salvagnin, D.: A local dominance procedure for mixed-integer linear programming. Technical report, ARRIVAL project (2007)
18. Fourer R.; Gay D.: The AMPL Book. Duxbury Press, Pacific Grove (2002)
19. Friedman, E.J.: Fundamental domains for integer programs with symmetries. In: Dress, A.; Xu, Y.; Zhu, B. (eds.) COCOA Proceedings, LNCS, vol. 4616, pp. 146-153. Springer (2007)
20. The GAP Group: GAP-Groups, Algorithms, and Programming, Version 4.4.10 (2007)
21. Hall M.: Theory of Groups. 2nd edn. Chelsea Publishing Company, New York (1976)
22. ILOG (2008) ILOG CPLEX 11.0 User's Manual. ILOG S.A.; Gentilly, France
23. V. Kaibel M. Pfetsch 2008 Packing and partitioning orbitopes Math. Program. 114 1 1 36 2386161 1171.90004 10.1007/s10107-006-0081-5 (Pubitemid 351438158)
24. R. Laundy M. Perregaard G. Tavares H. Tipi A. Vazacopoulos 2009 Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study Inf. J. Comput. 21 2 304 313 2549128 10.1287/ijoc.1080.0293
25. J. Lee F. Margot 2007 On a binary-encoded ILP coloring formulation Inf. J. Comput. 19 3 406 415 2344074 10.1287/ijoc.1060.0178
26. Leyffer, S.: MacMINLP-AMPL collection of mixed integer nonlinear programs. http://www.mcs.anl.gov/~leyffer/macminlp/ (2000)
27. Liberti, L.: Framework for symbolic computation in C++ using n-ary trees. Technical report, CPSE, Imperial College London (2001)
28. Liberti L.: Writing global optimization software. In: Liberti, L.; Maculan, N. (eds) Global Opti- mization: from Theory to Implementation, pp. 211-262. Springer, Berlin (2006)
29. Liberti L.: Automatic generation of symmetry-breaking constraints. In: Yang, B.; Du, D.-Z.; Wang, C.A. (eds) COCOA Proceedings, LNCS, vol. 5165, pp. 328-338. Springer, Berlin (2008)
30. Liberti, L.: Reformulations in mathematical programming: symmetry. Technical Report 2165, Optimization Online (2008)
31. L. Liberti 2009 Reformulations in mathematical programming: definitions and systematics RAIRO-RO 43 1 55 86 2502325 1158.90390 10.1051/ro/2009005
32. Liberti L.; Cafieri S.; Tarissan F.: Reformulations in mathematical programming: a computational approach. In: Abraham, A.; Hassanien, A.-E.; Siarry, P.; Engelbrecht, A. (eds) Foundations of Computational Intelligence, vol. 3, number 203 in Studies in Computational Intelligence, pp. 153-234. Springer, Berlin (2009)
33. Liberti L.; Mladenović N.; Nannicini G.: A good recipe for solving MINLPs. In: Maniezzo, V.; Stützle, T.; Vo, S. (eds) Hybridizing Metaheuristics and Mathematical Programming, volume 10 of Annals of Information Systems, pp. 231-244. Springer, New York (2009)
34. F. Margot 2002 Pruning by isomorphism in branch-and-cut Math. Program. 94 71 90 1953166 1023.90088 10.1007/s10107-002-0358-2 (Pubitemid 44744731)
35. F. Margot 2003 Exploiting orbits in symmetric ILP Math. Program. B 98 3 21 2019365 1082.90070 10.1007/s10107-003-0394-6
36. F. Margot 2003 Small covering designs by branch-and-cut Math. Program. B 94 207 220 1969109 1030.90144 10.1007/s10107-002-0316-z
37. F. Margot 2007 Symmetric ILP: coloring and small integers Discret. Optim. 4 40 62 2292484 1169.90411 10.1016/j.disopt.2006.10.008 (Pubitemid 46186199)
38. Margot F.: Symmetry in integer linear programming. In: Jünger, M.; Liebling, T.; Naddef, D.; Nemhauser, G.; Pulleyblank, W.; Reinelt, G.; Rinaldi, G.; Wolsey, L. (eds) 50 Years of Integer Programming, pp. 647-681. Springer, Berlin (2010)
39. Martin, A.; Achterberg, T.; Koch, T.: Miplib 2003. Technical Report 05-28, ZIB (2005)
40. B. McKay 1981 Practical graph isomorphism Congr. Numerantium 30 45 87 635936
41. McKay B.: Nauty User's Guide (Version 2.4). Computer Science Department, Australian National University, Canberra (2007)
42. A. Neumaier 2004 Complete search in continuous global optimization and constraint satisfaction Acta Numer. 13 271 369 2249148 10.1017/CBO9780511569975. 004 (Pubitemid 38773595)
43. Ostrowski, J.; Linderoth, J.; Rossi, F.; Smriglio, S.: Orbital branching. In: Fischetti, M.; Williamson, D.P. (eds.) IPCO, LNCS, vol. 4513, pp. 104-118. Springer (2007)
44. Ostrowski, J.; Linderoth, J.; Rossi, F.; Smriglio, S.: Constraint orbital branching. In: Lodi, A.; Panconesi, A.; Rinaldi, G. (eds.) IPCO, LNCS, vol. 5035, pp. 225-239. Springer (2008)
45. Ramani A.; Markov I.: Automatically exploiting symmetries in constraint programming. In: Faltings, B.; Petcu, A.; Fages, F.; Rossi, F. (eds) Constraint Solving and Constraint Logic Programming, LNAI, vol. 3419, pp. 98-112. Springer, Berlin (2005)
46. Rosen, K.H. (eds): Handbook of Discrete and Combinatorial Mathematics. CRC Press, New York (2000)
47. Sahinidis, N.V.; Tawarmalani, M.: BARON 7.2.5: Global Optimization of Mixed-Integer Nonlinear Programs, User's Manual (2005)
48. H. Schichl A. Neumaier 2005 Interval analysis on directed acyclic graphs for global optimization J. Glob. Optim. 33 4 541 562 2189879 1094.65061 10.1007/s10898-005-0937-x (Pubitemid 41690335)
49. Seress A.: Permutation Group Algorithms. Cambridge University Press, Cambridge (2003)
50. H. Sherali C. Smith 2001 Improving discrete model representations via symmetry considerations Manag. Sci. 47 10 1396 1407 10.1287/mnsc.47.10.1396. 10265 (Pubitemid 34192849)
51. R. Uehara S. Toda T. Nagoya 2005 Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs Discret. Appl. Math. 145 479 482 2112539 1056.05099 10.1016/j.dam.2004.06.008
52. Vallentin, F.: Symmetry in semidefinite programs. Technical Report 1702, Optimization Online (2007)
53. Wielandt H.: Finite Permutation Groups. Academic Press, New York (1964)
54. Wolsey L.A.: Integer Programming. Wiley, New York (1998)
55. W. Zhu 2006 Unsolvability of some optimization problems Appl. Math. Comput. 174 921 926 2220588 1098.65071 10.1016/j.amc.2005.05.025