Set covering approach for reconstruction of sibling relationships
From MaRDI portal
Publication:5758164
DOI10.1080/10556780600881829zbMath1116.92044OpenAlexW2015201000MaRDI QIDQ5758164
Bhaskar Das Gupta, Mary V. Ashley, Tanya Y. Berger-Wolf, Wanpracha Art Chaovalitwongse
Publication date: 3 September 2007
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780600881829
combinatorial optimizationset covering problemslinear assignment problemsDNA markerssibling relationships
Combinatorial optimization (90C27) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)
Related Items
A-priori upper bounds for the set covering problem, Integer linear programming formulations for double roman domination problem, Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction, On approximating four covering and packing problems, On Approximating an Implicit Cover Problem in Biology, A commentary on some recent methods in sibling group reconstruction based on set coverings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- Enhancing an algorithm for set covering problems
- A genetic algorithm for the set covering problem
- Computational experience with approximation algorithms for the set covering problem
- Approximability of hard combinatorial optimization problems: an introduction
- Partition-distance: A problem and class of perfect graphs arising in clustering
- An algorithm for set covering problem
- Solving hard set covering problems
- A threshold of ln n for approximating set cover
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- A Greedy Heuristic for the Set-Covering Problem
- A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
- A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- Note: A local-search heuristic for large set-covering problems
- Non-approximability results for optimization problems on bounded degree instances
- Simplification of the Covering Problem with Application to Boolean Expressions
- The Location of Emergency Service Facilities
- Algorithms for the set covering problem
