✦ LIBER ✦

Benders-and-cut algorithm for fixed-charge capacitated network design problem

✍ Scribed by Varadharajan Sridhar; June S. Park

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-cut algorithm for capacitat

✍ Oktay Günlük 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 173 KB

A two-phase heuristic algorithm for the

✍ Jae-Gon Kim; Hong-Bae Jun; Chong-Man Kim 📂 Article 📅 2011 🏛 Korean Society of Civil Engineers 🌐 English ⚖ 533 KB

A branch-and-cut algorithm for the singl

✍ Francisco Ortega; Laurence A. Wolsey 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB 👁 1 views

Approximation Algorithms for a Capacitat

✍ Refael Hassin; R. Ravi; F. Sibel Salman 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 804 KB

On cut-based inequalities for capacitate

✍ Christian Raack; Arie M.C.A. Koster; Sebastian Orlowski; Roland Wessäly 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 375 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