✦ LIBER ✦

Algorithms for the Set Covering Problem

✍ Scribed by Alberto Caprara; Paolo Toth; Matteo Fischetti

Book ID: 110386642
Publisher: Springer US
Year: 2000
Tongue: English
Weight: 101 KB
Volume: 98
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1019225027893

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational experience with approximat

Computational experience with approximation algorithms for the set covering problem

✍ Tal Grossman; Avishai Wool 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 722 KB

The Set Covering problem (SCP) is a well known combinatorial optimization problem, which is NP-hard. We conducted a comparative study of nine different approximation algorithms for the SCP, including several greedy variants, fractional relaxations, randomized algorithms and a neural network algorith

Experiments with parallel branch-and-bou

Experiments with parallel branch-and-bound algorithms for the set covering problem

✍ Russell A. Rushmeier; George L. Nemhauser 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 773 KB

Efficient heuristic algorithms for the w

Efficient heuristic algorithms for the weighted set covering problem

✍ Edward K. Baker 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 745 KB

Approximation Algorithms for the Set Cov

Approximation Algorithms for the Set Covering and Vertex Cover Problems

✍ Hochbaum, Dorit S. 📂 Article 📅 1982 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 259 KB

A genetic algorithm for the set covering

A genetic algorithm for the set covering problem

✍ J.E Beasley; P.C Chu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 939 KB

A heuristic algorithm for the multi-crit

A heuristic algorithm for the multi-criteria set-covering problems

✍ Yi-Hsin Liu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 150 KB