Exact and heuristic approaches for the set cover with pairs problem
From MaRDI portal
Publication:691479
DOI10.1007/S11590-011-0289-ZzbMath1262.90145OpenAlexW2043456971MaRDI QIDQ691479
Luciana Brugiolo Gonçalves, Simone de Lima Martins
Publication date: 30 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0289-z
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving haplotyping inference parsimony problem using a new basic polynomial formulation
- The minimum substring cover problem
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
- Effective heuristics for the Set Covering with Pairs Problem
- Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping
- The pure parsimony haplotyping problem: overview and computational advances
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Exact and heuristic approaches for the set cover with pairs problem
