✦ LIBER ✦

A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems

✍ Scribed by Bruce W. Lamar, Yosef Sheffi and Warren B. Powell

Book ID: 123687299
Publisher: INFORMS
Year: 1990
Tongue: English
Weight: 294 KB
Volume: 38
Category: Article
ISSN: 0030-364X
DOI: 10.2307/171089

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On lower bounds for the fixed charge pro

On lower bounds for the fixed charge problem

✍ Adlakha, Veena; Kowalski, Krzysztof 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 326 KB

Lower bounding techniques for the degree

Lower bounding techniques for the degree-constrained network design problem

✍ Güvenç Şahin; Ravindra K. Ahuja 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB 👁 1 views

A concave link elimination (CLE) procedu

A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems

✍ Chris H.E. Stacey; Tony Eyers; Gary J. Anido 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 167 KB

A branch-and-bound algorithm for solving

A branch-and-bound algorithm for solving fixed charge problems

✍ Patrick G. McKeown 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 616 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 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