✦ LIBER ✦

A Greedy Heuristic for the Set-Covering Problem

✍ Scribed by V. Chvatal

Book ID: 121001358
Publisher: INFORMS
Year: 1979
Tongue: English
Weight: 156 KB
Volume: 4
Category: Article
ISSN: 0364-765X
DOI: 10.2307/3689577

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Greedy Heuristic for the Set-Covering

A Greedy Heuristic for the Set-Covering Problem

✍ Chvatal, V. 📂 Article 📅 1979 🏛 INFORMS 🌐 English ⚖ 116 KB

A modified greedy heuristic for the Set

A modified greedy heuristic for the Set Covering problem with improved worst case bound

✍ Olivier Goldschmidt; Dorit S. Hochbaum; Gang Yu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 458 KB

A hybrid heuristic for the set covering

A hybrid heuristic for the set covering problem

✍ Shyam Sundar, Alok Singh 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 802 KB

A Heuristic Method for the Set Covering

A Heuristic Method for the Set Covering Problem

✍ Alberto Caprara, Matteo Fischetti and Paolo Toth 📂 Article 📅 1999 🏛 INFORMS 🌐 English ⚖ 484 KB

Simple Lagrangian heuristic for the set

Simple Lagrangian heuristic for the set covering problem

✍ Salim Haddadi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 353 KB

In this paper a simple Lagrangian heuristic is proposed for the set covering problem. It is based on simple and classica1 ideas: Lagrangian duality, greedy heuristic for the set covering problem, subgradient optimization and redundant covers. The main interesting point of the paper lies in the fact

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