Solving large Steiner Triple Covering Problems

Operations Research Letters

Volumn 39, Issue 2, 2011, Pages 127-131

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

^a UNIVERSITY OF WATERLOO   (Canada)

^b University of Wisconsin Madison   (United States)

^c UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Branch and bound algorithms; Integer programming; Steiner Triple Systems; Symmetry

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; COVERING PROBLEMS; INCIDENCE MATRICES; INTEGER PROGRAM; OPTIMAL SOLUTIONS; SET COVERING PROBLEM; STEINER TRIPLE SYSTEMS; SYMMETRY;

ALGORITHMS; BRANCH AND BOUND METHOD;

INTEGER PROGRAMMING;

EID: 79953054839     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2011.02.001     Document Type: Article

References (16)

1. D. Avis A note on some computationally difficult set covering problems Mathematical Programming 8 1980 138 145
2. P.T. Darga, M.H. Liffiton, K.A. Sakallah, and I.L. Markov Exploiting structure in symmetry detection for CNF Design Automation Conference (DAC) 2004 530 534
3. T.A. Feo, and G.C. Resende A probabilistic heuristic for a computationally difficult set covering problem Operations Research Letters 8 1989 67 71
4. D.R. Fulkerson, G.L. Nemhauser, and L.E. Trotter Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triples Mathematical Programming Study 2 1974 72 81
5. M. Hall Combinatorial Theory 1967 Blaisdell Company
6. N. Karmarkar, K. Ramakrishnan, and M. Resende An interior point algorithm to solve computationally difficult set covering problems Mathematical Programming, Series B 52 1991 597 618
7. T.P. Kirkman On a problem in combinations Cambridge and Dublin Mathematics Journal 2 1847 191 204
8. L. Liberti, Reformulations in mathematical programming: Symmetry, Mathematical Programming. Online at http://www.springerlink.com/content/ g762r1808m5633xt/, doi:10.1007/s10107-010-0351-0.
9. C. Mannino, and A. Sassano Solving hard set covering problems Operations Research Letters 18 1995 1 5 (Pubitemid 126648511)
10. F. Margot Pruning by isomorphism in branch-and-cut Mathematical Programming 94 2002 71 90 (Pubitemid 44744731)
11. B.D. McKay, Nauty Users Guide (Version 1.5), Australian National University, Canberra, 2002.
12. P.R.J. stergrd, V.P. Vaskelainen, Russian doll search for the steiner triple covering problem, Optimization Letters, Online at http://www. springerlink.com/content/y41000747x2g3m46/, doi:10.1007/s11590-010-0225-7.
13. J. Ostrowski, J. Linderoth, F. Rossi, and S. Smriglio Orbital branching Mathematical Programming Series A. 126/1 2011 147 178
14. M.A. Odijk, and H. van Maaren Improved solutions to the Steiner triple covering problem Information Processing Letters 65 2 1998 67 69 (Pubitemid 128640718)
15. J. Ostrowski, J. Linderoth, F. Rossi, and S. Smriglio Constraint orbital branching IPCO 2008: The Thirteenth Conference on Integer Programming and Combinatorial Optimization Lecture Notes in Computer Science 5035 2008 Springer 225 239
16. J. Ostrowski, J. Linderoth, F. Margot, Flexible isomorphism pruning. Unpublished working paper (2010).