Constraint orbital branching

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

Volumn 5035 LNCS, Issue , 2008, Pages 225-239

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

^a Lehigh University   (United States)

^b University of Wisconsin Madison   (United States)

^c UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AEROSPACE APPLICATIONS; BRANCH AND BOUND METHOD; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COMPUTER SOFTWARE SELECTION AND EVALUATION; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; NONLINEAR PROGRAMMING; OPTIMIZATION; ROCKETS; SOLUTIONS;

(R ,S)-SYMMETRIC; CARDINALITY; HEIDELBERG (CO); INTEGER PROGRAMS; INTERNATIONAL CONFERENCES; ORBITAL (CO); SPRINGER (CO); STEINER TRIPLE SYSTEM (STS); STRUCTURAL INFORMATIONS;

INTEGER PROGRAMMING;

EID: 45749096688     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68891-4_16     Document Type: Conference Paper

References (29)

1. 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)
2. th International Symposium on Mathematical Programming (2000)
3. Sherali, H.D., Smith, J.C.: Improving zero-one model representations via symmetry considerations. Management Science 47(10), 1396-1407 (2001)
4. Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Mathematical Programming (to appear, 2007)
5. Kaibel, V., Peinhardt, M., Pfetsch, M.: Orbitopal fixing. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 74-88. Springer, Heidelberg (2007)
6. Read, R.C.: Every one a winner or how to avoid isomorphism search when cataloguing combinatorial configurations. Annals of Discrete Mathematics 2, 107-120 (1998)
7. Butler, G., Lam, W.H.: A general backtrack algorithm for the isomorphism problem of combinatorial objects. Journal of Symbolic Computation 1, 363-381 (1985)
8. McKay, D.: Isomorph-free exhaustive generation. Journal of Algorithms 26, 306-324 (1998)
9. Margot, F.: Pruning by isomorphism in branch-and-cut. Mathematical Programming 94, 71-90 (2002)
10. 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)
11. Linderoth, J., Margot, F., Thain, G.: Improving bounds on the football pool problem via symmetry reduction and high-throughput computing (submitted, 2007)
12. Mannino, C., Sassano, A.: Solving hard set covering problems. Operations Research Letters 18, 1-5 (1995)
13. Karamanov, M., Cornuéjols, G.: Branching on general disjunctions (submitted, 2005)
14. Kirkman, T.P.: On a problem in combinations. Cambridge and Dublin Mathematics Journal 2, 191-204 (1847)
15. 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, 72-81 (1974)
16. Avis, D.: A note on some computationally difficult set covering problems. Mathematical Programming 8, 138-145 (1980)
17. Hall, M.: Combinatorial Theory. Blaisdell Company (1967)
18. Feo, T.A., Resende, G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8, 67-71 (1989)
19. Karmarkar, N., Ramakrishnan, K., Resende, M.: An interior point algorithm to solve computationally difficult set covering problems. Mathematical Programming, Series B 52, 597-618 (1991)
20. Odijk, M.A., van Maaren, H.: Improved solutions to the Steiner triple covering problem. Information Processing Letters 65(2), 67-69 (1998)
21. The GAP Group: GAP-Groups, Algorithms, and Programming, Version 4.4 (2004), http://www.gap-system.org
22. Danna, E., Fenelon, M., Gu, Z., Wunderling, R.: Generating multiple solutions for mixed integer programming problems. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 280-294. Springer, Heidelberg (2007)
23. Livny, M., Basney, J., Raman, R., Tannenbaum, T.: Mechanisms for high throughput computing. SPEEDUP 11 (1997)
24. Schönheim, J.: On coverings. Pacific Journal of Mathematics 14, 1405-1411 (1964)
25. Margot, F.: Exploiting orbits in symmetric ILP. Mathematical Programming, Series B 98, 3-21 (2003)
26. Nurmela, K.J., Ö stergård, P.: Upper bounds for covering designs by simulated annealing. Congressus Numerantium 96, 93-111 (1993)
27. Applegate, D., Rains, E., Sloane, N.: On asymmetric coverings and covering numbers. Journal of Combinatorial Designs 11, 218-228 (2003)
28. Gordon, D., Kuperberg, G., Patashnik, O.: New constructions for covering designs. Journal of Combinatorial Designs 3, 269-284 (1995)
29. Margot, F.: Small covering designs by branch-and-cut. Mathematical Programming 94, 207-220 (2003)