✦ LIBER ✦

A note on some computationally difficult set covering problems

✍ Scribed by Davis Avis

Publisher: Springer-Verlag
Year: 1980
Tongue: English
Weight: 375 KB
Volume: 18
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01588309

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

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

An interior point algorithm to solve com

An interior point algorithm to solve computationally difficult set covering problems

✍ Narendra Karmarkar; Mauricio G. C. Resende; K. G. Ramakrishnan 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 968 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

Solving large set covering problems on a

Solving large set covering problems on a personal computer

✍ Francis J. Vasko; Floyd E. Wolf 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 583 KB

On a class of problems on covering of a

On a class of problems on covering of a bounded set

✍ S. V. Yakovlev 📂 Article 📅 1989 🏛 Akadmiai Kiad 🌐 English ⚖ 515 KB