✦ LIBER ✦

Approximation algorithms for multi-index transportation problems with decomposable costs

✍ Scribed by M. Queyranne; F.C.R. Spieksma

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 849 KB
Volume: 76
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00128-x

No coin nor oath required. For personal study only.

✦ Synopsis

The axial multi-index transportation problem is defined as follows. Given are k sets A,, each set having n, elements, r = 1,. , k. The Cartesian product of the sets A, is denoted by A.

📜 SIMILAR VOLUMES

A mean cost approximation for transporta

A mean cost approximation for transportation problems with stochastic demand

✍ Dan Wilson 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 302 KB

Lagrangian dual coordinatewise maximizat

Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs

✍ Azuma Ohuchi; Ikuo Kaji 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 581 KB

2-Approximation algorithms for the multi

2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times

✍ Yoshiyuki Karuno; Hiroshi Nagamochi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 180 KB

In this paper, given a path G with n vertices v1; v2; : : : ; vn and m identical vehicles, we consider a scheduling problem of the vehicles on the path. Each vertex vj in G has exactly one job j. Any of the n jobs must be served by some vehicle. Each job j has a release time rj and a handling time h