✦ LIBER ✦

The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs

✍ Scribed by S. Bianchi; G. Nasini; P. Tolomei

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

On the Set-Covering Problem: II. An Algo

✍ Egon Balas and Manfred Padberg 📂 Article 📅 1975 🏛 INFORMS 🌐 English ⚖ 511 KB

On the Fractional Solution to the Set Co

✍ Hochbaum, Dorit S. 📂 Article 📅 1983 🏛 Society for Industrial and Applied Mathematics ⚖ 223 KB

On approximation problems related to the

✍ R. Bar-Yehuda; S. Moran 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 549 KB

On the Effectiveness of Set Covering For

✍ Julien Bramel and David Simchi-Levi 📂 Article 📅 1997 🏛 INFORMS 🌐 English ⚖ 333 KB

On the first Chvátal closure of the set

✍ Tolomei, Paola B.; Torres, Luis M. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 189 KB