Improved solutions to the Steiner triple covering problem

DOI10.1016/S0020-0190(97)80440-1zbMATH Open1338.68207MaRDI QIDQ293185FDOQ293185

Authors: 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

zbMATH Keywords

combinatorial problemsset covering problemsSteiner triple systemswidth of matrices

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Cites Work

• Title not available (Why is that?)
• A Greedy Heuristic for the Set-Covering Problem
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Width Sequences for Special Classes of (0, 1)-Matrices

Cited In (7)

• Title not available (Why is that?)
• Constraint Orbital Branching
• A biased random-key genetic algorithm for the Steiner triple covering problem
• Russian doll search for the Steiner triple covering problem
• A random-key GRASP for combinatorial optimization
• Solving large Steiner Triple Covering Problems
• A 3-flip neighborhood local search for the set covering problem

This page was built for publication: Improved solutions to the Steiner triple covering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293185)