✦ LIBER ✦

Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem

✍ Scribed by Thiongane, Babacar; Cordeau, Jean-François; Gendron, Bernard

Book ID: 127190112
Publisher: Elsevier Science
Year: 2015
Tongue: English
Weight: 370 KB
Volume: 53
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2014.07.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycle-Based Neighbourhoods for Fixed-Cha

Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design

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

A Cutting-Plane Neighborhood Structure f

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

✍ Yaghini, Masoud; Karimi, Mohammad; Rahbar, Mohadeseh; Sharifitabar, Mohammad Has 📂 Article 📅 2015 🏛 Operations Research Society of America 🌐 English ⚖ 350 KB

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

Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design

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

On the use of guided design search for d

On the use of guided design search for discovering significant decision variables in the fixed-charge capacitated multicommodity network design problem

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

Benders-and-cut algorithm for fixed-char

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

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

A capacity scaling heuristic for the mul

A capacity scaling heuristic for the multicommodity capacitated network design problem

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