Orbital branching

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

Volumn 4513 LNCS, Issue , 2007, Pages 104-118

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

^a Lehigh University   (United States)

^b UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; DECISION MAKING; PROBLEM SOLVING; TREES (MATHEMATICS);

BRANCHING DECISIONS; BRANCHING RULES; ISOMORPHISM; ORBITAL BRANCHING;

INTEGER PROGRAMMING;

EID: 38049033348     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72792-7_9     Document Type: Conference Paper

References (20)

1. Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch and Price: Column generation for solving huge integer programs. Operations Research 46 (1998) 316-329
2. Holm, S., Sørensen, M.: The optimal graph partitioning problem: Solution method based on reducing symmetric nature and combinatorial cuts. OR Spectrum 15 (1993) 1-8
3. Méndez-Díaz, I., Zabala, P.: A branch-and-cut algorithm for graph coloring. Discrete Applied Mathematics 154(5) (2006) 826-847
4. Macambira, E.M., Maculan, N., de Souza, C.C.: Reducing symmetry of the SONET ring assignment problem using hierarchical inequalities. Technical Report ES636/04, Programa de Engenharia de Sistemas e Computação, Universidade Federal do Rio de Janeiro (2004)
5. Rothberg, E.: Using cuts to remove symmetry. Presented at the 17 International Symposium on Mathematical Programming
6. Sherali, H.D., Smith, J.C.: Improving zero-one model representations via symmetry considerations. Management Science 47(10) (2001) 1396-1407
7. Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Mathemathical Programming (2007) To appear.
8. Kaibel, V., Peinhardt, M., Pfetsch, M.: Orbitopal fixing. In: IPCO 2007: The Twelfth Conference on Integer Programming and Combinatorial Optimization, Springer (2007) To appear.
9. Margot, F.: Pruning by isomorphism in branch-and-cut. Mathematical Programming 94 (2002) 71-90
10. Margot, F.: Exploiting orbits in symmetric ILP. Mathematical Programming, Series B 98 (2003) 3-21
11. Bazaraa, M.S., Kirca, O.: A branch-and-bound heuristic for solving the quadratic assignment problem. Naval Research Logistics Quarterly 30 (1983) 287-304
12. Nemhauser, G.L., Savelsbergh, M.W.P., Sigismondi, G.C.: MINTO, a Mixed INTeger Optimizer. Operations Research Letters 15 (1994) 47-58
13. McKay, B.D.: Nauty User's Guide (Version 1.5). Australian National University, Canberra. (2002)
14. Foggia, P., Sansone, C., Vento, M.: A preformance comparison of five algorithms for graph isomorphism. Proc. 3rd IAPR-TC15 Workshop Graph-Based Representations in Pattern Recognition (2001) 188-199
15. 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. Elsevier, Amsterdam (1998) 463-498
16. Mills, W.H., Mullin, R.C.: Coverings and packings. In: Contemporary Design Theory: A Collection of Surveys. Wiley (1992) 371-399
17. Hamalainen, H., Honkala, I., Litsyn, S., Ostergård, P.: Football pools - A game for mathematicians. American Mathematical Monthly 102 (1995) 579-588
18. Fulkerson, D.R., Nemhauser, G.L., Trotter, L.E.: Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triples. Mathematical Programming Study 2 (1973) 72-81
19. Margot, F.: Small covering designs by branch-and-cut. Mathematical Programming 94 (2003) 207-220
20. Dolan, E., Moré, J.: Benchmarking optimization software with performance profiles. Mathematical Programming 91 (2002) 201-213