Russian doll search for the Steiner triple covering problem
From MaRDI portal
Publication:644513
DOI10.1007/s11590-010-0225-7zbMath1228.90100MaRDI 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
Related Items
Algorithms for finding maximum transitive subtournaments, Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations, 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, Solving large Steiner Triple Covering Problems
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item