✦ LIBER ✦

A capacity scaling heuristic for the multicommodity capacitated network design problem

✍ Scribed by N. Katayama; M. Chen; M. Kubo

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 570 KB
Volume: 232
Category: Article
ISSN: 0377-0427
DOI: 10.1016/j.cam.2008.10.055

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The multicommodity assignment problem: a

The multicommodity assignment problem: a network aggregation heuristic

✍ James R. Evans 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 381 KB

A Lagrangean heuristic for the capacitat

A Lagrangean heuristic for the capacitated concave minimum cost network flow problem

✍ Torbjörn Larsson; Athanasios Migdalas; Mikael Rönnqvist 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 684 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

A heuristic lagrangean algorithm for the

A heuristic lagrangean algorithm for the capacitated plant location problem

✍ J. Barceló; J. Casanovas 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 709 KB

Large-scale local search heuristics for

Large-scale local search heuristics for the capacitated vertex p-center problem

✍ Maria Paola Scaparra; Stefano Pallottino; Maria Grazia Scutellà 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB

## Abstract This article investigates the application of very large neighborhood search techniques for solving the capacitated vertex __p__‐center problem. We characterize a local search neighborhood in terms of path and cyclic exchanges of customers among facilities, and exploit principles borrowe

A heuristic Lagrangean algorithm for the

A heuristic Lagrangean algorithm for the capacitated plant location problem — A comment

✍ R. Sridharan 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 81 KB