𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A surrogate heuristic for set covering problems

✍ Scribed by Luiz Antonio N. Lorena; Fábio Belo Lopes

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
733 KB
Volume
79
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.

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