Orbital branching

Mathematical Programming

Volumn 126, Issue 1, 2011, Pages 147-178

  Ostrowski, James ^a   Linderoth, Jeff ^c   Rossi, Fabrizio ^b   Smriglio, Stefano ^b  

^a Lehigh University   (United States)

^b UNIVERSITY OF L'AQUILA   (Italy)

^c NONE

Author keywords

Branch and bound algorithms; Integer programming; Symmetry

Indexed keywords

BRANCH AND BOUNDS; BRANCH-AND-BOUND ALGORITHMS; BRANCHING RULES; COMMERCIAL SOLVERS; EMPIRICAL STUDIES; FEASIBLE REGIONS; INTEGER PROGRAM; PROGRAMMING SOFTWARE; ROOT NODES; SYMMETRY;

ALGORITHMS; BRANCH AND BOUND METHOD;

INTEGER PROGRAMMING;

EID: 78651441888     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-009-0273-x     Document Type: Article

References (26)

1. T. Achterberg T. Koch A. Martin 2004 Branching rules revisited Oper. Res. Lett. 33 42 54 10.1016/j.orl.2004.04.002 2091034
2. C. Barnhart E.L. Johnson G.L. Nemhauser M.W.P. Savelsbergh P.H. Vance 1998 Branch and price: column generation for solving huge integer programs Oper. Res. 46 316 329 0979.90092 10.1287/opre.46.3.316 1663050
3. Cameron P.J.: Permutation Groups. London Mathematical Society, London (1999)
4. E. Dolan J. Moré 2002 Benchmarking optimization software with performance profiles Math. Program. 91 201 213 1049.90004 10.1007/s101070100263 1875515 (Pubitemid 44744777)
5. Foggia, P., Sansone, C., Vento, M.: A preformance comparison of five algorithms for graph isomorphism. In: Proc. 3rd IAPR-TC15 Workshop Graph-Based Representations in Pattern Recognition, pp. 188-199 (2001)
6. D.R. Fulkerson G.L. Nemhauser L.E. Trotter 1973 Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triples Math. Program. Study 2 72 81
7. Grove L.C., Benson C.T.: Finite Reflection Groups. Springer, Heidelberg (1985)
8. H. Hamalainen I. Honkala S. Litsyn P. Östergård 1995 Football pools-a game for mathematicians Am. Math. Monthly 102 579 588 10.2307/2974552
9. S. Holm M. Sørensen 1993 The optimal graph partitioning problem: solution method based on reducing symmetric nature and combinatorial cuts OR Spectrum 15 1 8 0784.90096
10. Kaibel, V., Peinhardt, M., Pfetsch, M.E.: Orbitopal fixing. In: IPCO 2007: The Twelfth Conference on Integer Programming and Combinatorial Optimization, pp. 74-88. Springer, Heidelberg (2007)
11. V. Kaibel M.E. Pfetsch 2008 Packing and partitioning orbitopes Math. Program. 114 1 36 1171.90004 10.1007/s10107-006-0081-5 2386161 (Pubitemid 351438158)
12. J.T. Linderoth M.W.P. Savelsbergh 1999 A computational study of search strategies in mixed integer programming INFORMS J. Comput. 11 173 187 1040.90535 10.1287/ijoc.11.2.173 1696032
13. Litsyn S.: An updated table of the best binary codes known. In: Pless, V.S., Huffman, W.C. (eds) Handbook of Coding Theory volume 1, pp. 463-498. Elsevier, Amsterdam (1998)
14. Macambira, E.M., Maculan, N., de Souza, C.C.: Reducing symmetry of the SONET ring assignment problem using hierarchical inequalities. Technical Report ES-636/04, Programa de Engenharia de Sistemas e Computação, Universidade Federal do Rio de Janeiro (2004)
15. F. Margot 2002 Pruning by isomorphism in branch-and-cut Math. Program. 94 71 90 1023.90088 10.1007/s10107-002-0358-2 1953166 (Pubitemid 44744731)
16. F. Margot 2003 Exploiting orbits in symmetric ILP Math. Program. Ser. B 98 3 21 1082.90070 10.1007/s10107-003-0394-6 2019365
17. F. Margot 2003 Small covering designs by branch-and-cut Math. Program. 94 207 220 1030.90144 10.1007/s10107-002-0316-z 1969109
18. McKay B.D.: Nauty User's Guide (Version 1.5). Australian National University, Canberra (2002)
19. I. Méndez-Díaz P. Zabala 2006 A branch-and-cut algorithm for graph coloring Discrete Appl. Math. 154 5 826 847 1120.90034 10.1016/j.dam.2005.05.022 2207566
20. Mills, W.H., Mullin, R.C.: Coverings and packings. In: Contemporary Design Theory: A Collection of Surveys, pp. 371-399. Wiley, New York (1992)
21. G.L. Nemhauser M.W.P. Savelsbergh G.C. Sigismondi 1994 MINTO, a Mixed INTeger Optimizer Oper. Res. Lett. 15 47 58 0806.90095 10.1016/0167-6377(94) 90013-2 1284187
22. Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. In: IPCO 2007: The Twelfth Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 4517, pp. 104-118. Springer, Heidelberg (2007)
23. Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Constraint orbital branching. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008: The Thirteenth Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 5035, pp. 225-239 (2008)
24. Rotman J.J.: An Introduction to the Theory of Groups, 4th edn. Springer, Heidelberg (1994)
25. E.C. Sewell 1998 A branch-and-bound algorithm for the stability number of a sparse graph INFORMS J. Comput. 10 438 447 10.1287/ijoc.10.4.438 1656932
26. H.D. Sherali J.C. Smith 2001 Improving zero-one model representations via symmetry considerations Manage. Sci. 47 10 1396 1407 10.1287/mnsc.47.10.1396. 10265