Improved solutions to the Steiner triple covering problem
From MaRDI portal
Publication:293185
DOI10.1016/S0020-0190(97)80440-1zbMath1338.68207MaRDI QIDQ293185
Michiel A. Odijk, Hans van Maaren
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097804401?np=y
Related Items (5)
Constraint Orbital Branching ⋮ Russian doll search for the Steiner triple covering problem ⋮ A biased random-key genetic algorithm for the Steiner triple covering problem ⋮ A 3-flip neighborhood local search for the set covering problem ⋮ Solving large Steiner Triple Covering Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A probabilistic heuristic for a computationally difficult set covering problem
- An interior point algorithm to solve computationally difficult set covering problems
- Greedy randomized adaptive search procedures
- Solving hard set covering problems
- Widths and Heights of (0,1) -Matrices
- Multiplicities and Minimal Widths for (0, 1)-Matrices
- A note on some computationally difficult set covering problems
- A Greedy Heuristic for the Set-Covering Problem
- Width Sequences for Special Classes of (0, 1)-Matrices
This page was built for publication: Improved solutions to the Steiner triple covering problem