𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An effective and simple heuristic for the set covering problem

✍ Scribed by Guanghui Lan; Gail W. DePuy; Gary E. Whitehouse

Book ID
108118030
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
776 KB
Volume
176
Category
Article
ISSN
0377-2217

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

An efficient heuristic for large set cov
An efficient heuristic for large set covering problems
✍ Francis J. Vasko πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 477 KB

## Abstract A heuristic solution procedure for set covering is presented that works well for large, relatively dense problems. In addition, a confidence interval is established about the unknown global optimum. Results are presented for 30 large randomly generated problems.

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

Parallel and serial heuristics for the m
Parallel and serial heuristics for the minimum set cover problem
✍ Sreejit Chakravarty; Ajay Shekhawat πŸ“‚ Article πŸ“… 1992 πŸ› Springer US 🌐 English βš– 695 KB

We present a theoretical analysis and an experimental evaluation of four serial heuristics and four parallel heuristics for the minimum set cover problem. The serial heuristics trade off run time with the quality of the solution. The parallel heuristics are derived from one of the serial heuristics.