✦ LIBER ✦

A branching method for the fixed charge transportation problem

✍ Scribed by Veena Adlakha; Krzysztof Kowalski; Benjamin Lev

Book ID: 113830724
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 179 KB
Volume: 38
Category: Article
ISSN: 0305-0483
DOI: 10.1016/j.omega.2009.10.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Branch-and-bound strategies for fixed-ch

Branch-and-bound strategies for fixed-charge transportation problems

📂 Article 📅 1983 🏛 Elsevier Science ⚖ 125 KB

On the fixed-charge transportation probl

On the fixed-charge transportation problem

✍ Veena Adlakha; Krzysztof Kowalski 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 129 KB

A study of the fixed charge transportati

A study of the fixed charge transportation problem

✍ Philip Robers; Leon Cooper 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 620 KB

A vertex ranking algorithm for the fixed

A vertex ranking algorithm for the fixed-charge transportation problem

✍ S. Sadagopan; A. Ravindran 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 479 KB

Algorithms for solving the single-sink f

Algorithms for solving the single-sink fixed-charge transportation problem

✍ Andreas Klose 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Capacity improvement, penalties, and the

Capacity improvement, penalties, and the fixed charge transportation problem

✍ Gavin J. Bell; Bruce W. Lamar; Chris A. Wallace 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

Capacity improvement and conditional penalties are two computational aides for fathoming subproblems in a branch-and-bound procedure. In this paper, we apply these techniques to the fixed charge transportation problem (FCTP) and show how relaxations of the FCTP subproblems can be posed as concave mi