𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two new heuristics for the location set covering problem

✍ Scribed by M. Almiñana; J. T. Pastor

Book ID
112784985
Publisher
Springer-Verlag
Year
1994
Tongue
English
Weight
560 KB
Volume
2
Category
Article
ISSN
1134-5764

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An adaptation of SH heuristic to the loc
An adaptation of SH heuristic to the location set covering problem
✍ Marcos Almiñana; Jesús T. Pastor 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 555 KB

In a recent paper, a new surrogate heuristic (SH) has been proposed for the set covering problem. Here we present an adaptation of it in order to solve more efficiently the location set covering problem. We will show that our new version not only outperforms algorithm SH but that it is more accurate

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