𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simple Lagrangian heuristic for the set covering problem

✍ Scribed by Salim Haddadi

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
353 KB
Volume
97
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

✦ Synopsis

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 that the proposed heuristic tums out to be efficient for low density set covering problems with a large number of variables.

πŸ“œ SIMILAR VOLUMES

A probabilistic heuristic for a computat
A probabilistic heuristic for a computationally difficult set covering problem
✍ Thomas A Feo; Mauricio G.C Resende πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 319 KB

An efficient probabilistic set covering heuristic is presented. The heuristic is evaluated on empirically difficult to solve set covering problems that arise from Steiner triple systems. The optimal solution to only a few of these instances is known. The heuristic provides these solutions as well as