✦ LIBER ✦

A note on the Clustered Set Covering Problem

✍ Scribed by Alfandari, Laurent; Monnot, Jérôme

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Set-Covering Problem

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

A note on ‘Algorithms for connected set

✍ Wei Ren; Qing Zhao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 229 KB

A note on the generalized min-sum set co

✍ Martin Skutella; David P. Williamson 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 208 KB

A note on some computationally difficult

✍ Davis Avis 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 375 KB

Solving a fuzzy set-covering problem

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

Algorithms for the Set Covering Problem

✍ Alberto Caprara; Paolo Toth; Matteo Fischetti 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 101 KB