✦ LIBER ✦

On the Set-Covering Problem: II. An Algorithm for Set Partitioning

✍ Scribed by Egon Balas and Manfred Padberg

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for set covering problem

✍ J.E. Beasley 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 763 KB

The Set-Partitioning Problem: Set Coveri

✍ R. S. Garfinkel and G. L. Nemhauser 📂 Article 📅 1969 🏛 INFORMS 🌐 English ⚖ 283 KB

An efficient algorithm for the complete

✍ Chien-Hua M. Lin; Harvey M. Salkin 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 439 KB

A genetic algorithm for the set covering

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

Enhancing an algorithm for set covering

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

On the Set-Covering Problem

✍ Egon Balas and Manfred W. Padberg 📂 Article 📅 1972 🏛 INFORMS 🌐 English ⚖ 344 KB