𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Enhancing an algorithm for set covering problems

✍ Scribed by J.E. Beasley; K. Jørnsten

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
535 KB
Volume
58
Category
Article
ISSN
0377-2217

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.