✦ LIBER ✦

A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem

✍ Scribed by Yaghini, Masoud; Karimi, Mohammad; Rahbar, Mohadeseh; Sharifitabar, Mohammad Hassan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycle-Based Neighbourhoods for Fixed-Cha

✍ Ghamlouche, Ilfat; Crainic, Teodor Gabriel; Gendreau, Michel 📂 Article 📅 2003 🏛 INFORMS 🌐 English ⚖ 292 KB

Formulations for the nonbifurcated hop-c

✍ Thiongane, Babacar; Cordeau, Jean-François; Gendron, Bernard 📂 Article 📅 2015 🏛 Elsevier Science 🌐 English ⚖ 370 KB

Branch-and-price-and-cut for large-scale

✍ Gendron, Bernard; Larose, Mathieu 📂 Article 📅 2014 🏛 Springer-Verlag 🌐 English ⚖ 270 KB

Benders-and-cut algorithm for fixed-char

✍ Varadharajan Sridhar; June S. Park 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

A capacity scaling heuristic for the mul

✍ N. Katayama; M. Chen; M. Kubo 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 570 KB

On the use of guided design search for d

✍ Mark W. Lewis 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB