Russian doll search for the Steiner triple covering problem

DOI10.1007/S11590-010-0225-7zbMATH Open1228.90100OpenAlexW2089098544MaRDI QIDQ644513FDOQ644513

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

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

zbMATH Keywords

set covering problemSteiner triple systemhitting set problemrussian doll search

Mathematics Subject Classification ID

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

Cites Work

• Minimaxsat: an efficient weighted Max-SAT solver
• Classification algorithms for codes and designs
• A fast algorithm for the maximum clique problem
• Title not available (Why is that?)
• Solving hard set covering problems
• Improved solutions to the Steiner triple covering problem
• A note on some computationally difficult set covering problems
• Title not available (Why is that?)
• Constraint Orbital Branching
• Title not available (Why is that?)
• A Max-SAT Inference-Based Pre-processing for Max-Clique
• Title not available (Why is that?)

Cited In (8)

• Exact solution algorithms for the maximum flow problem with additional conflict constraints
• Algorithms for finding maximum transitive subtournaments
• 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
• Title not available (Why is that?)
• A random-key GRASP for combinatorial optimization
• Solving large Steiner Triple Covering Problems

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)