๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Greedy Heuristic for the Set-Covering Problem

โœ Scribed by Chvatal, V.

Book ID
115547674
Publisher
INFORMS
Year
1979
Tongue
English
Weight
116 KB
Volume
4
Category
Article
ISSN
0364-765X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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