✦ LIBER ✦

A probabilistic heuristic for a computationally difficult set covering problem

✍ Scribed by Thomas A Feo; Mauricio G.C Resende

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 319 KB
Volume: 8
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(89)90002-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A lagrangian heuristic for set-covering

A lagrangian heuristic for set-covering problems

✍ J. E. Beasley 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 662 KB

A surrogate heuristic for set covering p

A surrogate heuristic for set covering problems

✍ Luiz Antonio N. Lorena; Fábio Belo Lopes 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 733 KB

Note: A local-search heuristic for large

Note: A local-search heuristic for large set-covering problems

✍ Larry W. Jacobs; Michael J. Brusco 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 751 KB

A heuristic algorithm for the multi-crit

A heuristic algorithm for the multi-criteria set-covering problems

✍ Yi-Hsin Liu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 150 KB

A modified greedy heuristic for the Set

A modified greedy heuristic for the Set Covering problem with improved worst case bound

✍ Olivier Goldschmidt; Dorit S. Hochbaum; Gang Yu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 458 KB