Solving large Steiner Triple Covering Problems

DOI10.1016/j.orl.2011.02.001zbMath1218.90103OpenAlexW2063045864MaRDI QIDQ2275579

Stefano Smriglio, Jeff Linderoth, James Ostrowski, Fabrizio Rossi

Publication date: 9 August 2011

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/60688

zbMATH Keywords

symmetryinteger programmingSteiner triple systemsbranch-and-bound algorithms

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items (4)

An efficient local search heuristic with row weighting for the unicost set covering problem ⋮ Using symmetry to optimize over the Sherali-Adams relaxation ⋮ A biased random-key genetic algorithm for the Steiner triple covering problem ⋮ Orbital shrinking: theory and applications

Uses Software

• nauty

Cites Work

• Unnamed Item
• Unnamed Item
• Improved solutions to the Steiner triple covering problem
• Orbital branching
• Russian doll search for the Steiner triple covering problem
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• A probabilistic heuristic for a computationally difficult set covering problem
• An interior point algorithm to solve computationally difficult set covering problems
• Pruning by isomorphism in branch-and-cut
• Solving hard set covering problems
• Constraint Orbital Branching
• A note on some computationally difficult set covering problems

This page was built for publication: Solving large Steiner Triple Covering Problems