A parallel genetic algorithm to solve the set-covering problem

DOI10.1016/S0305-0548(01)00026-0zbMath0994.90109WikidataQ57729534 ScholiaQ57729534MaRDI QIDQ1603319

Mauricio Solar, Rodrigo Urrutia, Víctor Parada

Publication date: 11 July 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00026-0

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

68W10: Parallel algorithms in computer science

Related Items

Solving a bicriteria problem of optimal service centers location, The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory, A GRASP algorithm to solve the unicost set covering problem, A mixed integer linear program and tabu search approach for the complementary edge covering problem, An electromagnetism metaheuristic for the unicost set covering problem, An adaptive heuristic algorithm for VLSI test vectors selection, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, A new approach for solving set covering problem using jumping particle swarm optimization method

Uses Software

• OR-Library

Cites Work

• 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\(\}\)
• On the 0,1 facets of the set covering polytope
• On the facial structure of the set covering polytope
• A probabilistic heuristic for a computationally difficult set covering problem
• Enhancing an algorithm for set covering problems
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
• A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
• Simplification of the Covering Problem with Application to Boolean Expressions
• The Location of Emergency Service Facilities