𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient heuristic algorithms for the weighted set covering problem

✍ Scribed by Edward K. Baker

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
745 KB
Volume
8
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

A generalization of the weighted set cov
A generalization of the weighted set covering problem
✍ Jian Yang; Joseph Y-T. Leung πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 122 KB

## Abstract We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect __b__‐matching problem. In general,