Exact and heuristic approaches for the set cover with pairs problem
From MaRDI portal
Publication:691479
DOI10.1007/S11590-011-0289-ZzbMATH Open1262.90145OpenAlexW2043456971MaRDI QIDQ691479FDOQ691479
Authors: 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
Recommendations
- Effective heuristics for the set covering with pairs problem
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Algorithms for the set covering problem
- A two-phase heuristic for set covering
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- Title not available (Why is that?)
- Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
- The pure parsimony haplotyping problem: overview and computational advances
- Solving haplotyping inference parsimony problem using a new basic polynomial formulation
- Title not available (Why is that?)
- The minimum substring cover problem
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Effective heuristics for the set covering with pairs problem
- Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping
Cited In (4)
Uses Software
This page was built for publication: Exact and heuristic approaches for the set cover with pairs problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691479)
