✦ LIBER ✦

Planar three-index transportation problems with dominating index

✍ Scribed by A. D. Korsnikov

Publisher: Springer
Year: 1988
Tongue: English
Weight: 156 KB
Volume: 32
Category: Article
ISSN: 0340-9422
DOI: 10.1007/bf01920570

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for the planar three-index

An algorithm for the planar three-index assignment problem

✍ D. Magos; P. Miliotis 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 743 KB

Tabu Search for the planar three-index a

Tabu Search for the planar three-index assignment problem

✍ D. Magos 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 787 KB

On representatives of multi-index transp

On representatives of multi-index transportation problems

✍ Werner Junginger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 956 KB

Approximation algorithms for multi-index

Approximation algorithms for multi-index transportation problems with decomposable costs

✍ M. Queyranne; F.C.R. Spieksma 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 849 KB

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.

A combinatorial approach to the problem

A combinatorial approach to the problem of solvability of the three-index transportation problem

✍ V. D. Matveenko 📂 Article 📅 1986 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 426 KB

Connected graphs with maximal Q-index: T

Connected graphs with maximal Q-index: The one-dominating-vertex case

✍ Ting-Chung Chang; Bit-Shun Tam 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 247 KB