✦ LIBER ✦

A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem

✍ Scribed by Xiangyong Li; Y.P. Aneja; Jiazhen Huo

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the article “A robust branch-a

✍ R. Montemanni; L.M. Gambardella 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 99 KB

Robust branch-cut-and-price for the Capa

✍ Eduardo Uchoa; Ricardo Fukasawa; Jens Lysgaard; Artur Pessoa; Marcus Poggi de Ar 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 318 KB

A branch-and-cut algorithm for the minim

✍ Diego Delle Donne; Javier Marenco 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 472 KB

A branch-and-bound algorithm for the min

✍ Gintaras Palubeckis, Dalius Rubliauskas 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 693 KB

A branch and cut algorithm for the hiera

✍ Carlos Obreque; Macarena Donoso; Gabriel Gutiérrez; Vladimir Marianov 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 619 KB

A Branch-And-Cut Algorithm for the Symme

✍ Matteo Fischetti, Juan José Salazar González and Paolo Toth 📂 Article 📅 1997 🏛 INFORMS 🌐 English ⚖ 855 KB