Russian doll search for the Steiner triple covering problem

DOI10.1007/S11590-010-0225-7MaRDI QIDQ644513zbMATH OpenOpenAlexFDO

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

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

set covering problemSteiner triple systemhitting set problemrussian doll search

Mathematics Subject Classification ID

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

Recommendations

• Solving large Steiner Triple Covering Problems
• Improved solutions to the Steiner triple covering problem
• The steiner problem in the hypercube
• Publication:4952636
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• The 3-Steiner Root Problem
• The fine intersection problem for Steiner triple systems
• Approximation algorithms for the covering Steiner problem
• The Steiner problem: a survey
• The embedding problem for partial Steiner triple systems

Cites work

• scientific article; zbMATH DE number 3550465 (Why is no real title available?)
• scientific article; zbMATH DE number 1314686 (Why is no real title available?)
• scientific article; zbMATH DE number 2084724 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• A Max-SAT Inference-Based Pre-processing for Max-Clique
• A fast algorithm for the maximum clique problem
• A note on some computationally difficult set covering problems
• Classification algorithms for codes and designs
• Constraint Orbital Branching
• Improved solutions to the Steiner triple covering problem
• Minimaxsat: an efficient weighted Max-SAT solver
• Solving hard set covering problems

Cited in

(8)

• Solving large Steiner Triple Covering Problems
• Algorithms for finding maximum transitive subtournaments
• A biased random-key genetic algorithm for the Steiner triple covering problem
• Exact solution algorithms for the maximum flow problem with additional conflict constraints
• The maximum independent union of cliques problem: complexity and exact approaches
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
• scientific article; zbMATH DE number 2084724 (Why is no real title available?)
• A random-key GRASP for combinatorial optimization

Describes a project that uses

Uses Software

• MiniMaxSat

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

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