Exact and heuristic approaches for the set cover with pairs problem

DOI10.1007/S11590-011-0289-ZMaRDI QIDQ691479zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

ILS metaheuristicset cover with pairs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1302177 (Why is no real title available?)
• scientific article; zbMATH DE number 1163714 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• Effective heuristics for the set covering with pairs problem
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
• Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping
• Solving haplotyping inference parsimony problem using a new basic polynomial formulation
• The minimum substring cover problem
• The pure parsimony haplotyping problem: overview and computational advances

Cited in

(4)

• Effective heuristics for the set covering with pairs problem
• Parallel and serial heuristics for the minimum set cover problem
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Pick-and-choose heuristics for partial set covering

Describes a project that uses

Uses Software

• OR-Library
• CPLEX

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)