✦ LIBER ✦

An algorithm for set covering problem

✍ Scribed by J.E. Beasley

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 763 KB
Volume: 31
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(87)90141-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enhancing an algorithm for set covering

Enhancing an algorithm for set covering problems

✍ J.E. Beasley; K. Jørnsten 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 535 KB

A genetic algorithm for the set covering

A genetic algorithm for the set covering problem

✍ J.E Beasley; P.C Chu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 939 KB

Efficient heuristic algorithms for the w

Efficient heuristic algorithms for the weighted set covering problem

✍ Edward K. Baker 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 745 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

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.

Solving a fuzzy set-covering problem

✍ M.J. Hwang; C.I. Chiang; Y.H. Liu 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 249 KB