Russian doll search for the Steiner triple covering problem

DOI10.1007/s11590-010-0225-7zbMath1228.90100OpenAlexW2089098544MaRDI QIDQ644513

Vesa P. Vaskelainen, Patric R. J. Östergård

Publication date: 4 November 2011

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0225-7

zbMATH Keywords

Steiner triple systemset covering problemhitting set problemrussian doll search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (6)

Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations ⋮ The maximum independent union of cliques problem: complexity and exact approaches ⋮ A biased random-key genetic algorithm for the Steiner triple covering problem ⋮ Solving large Steiner Triple Covering Problems ⋮ Exact solution algorithms for the maximum flow problem with additional conflict constraints ⋮ Algorithms for finding maximum transitive subtournaments

Uses Software

• MiniMaxSat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved solutions to the Steiner triple covering problem
• Classification algorithms for codes and designs
• A fast algorithm for the maximum clique problem
• Solving hard set covering problems
• A Max-SAT Inference-Based Pre-processing for Max-Clique
• Constraint Orbital Branching
• A note on some computationally difficult set covering problems

This page was built for publication: Russian doll search for the Steiner triple covering problem