๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Modified Vogel's approximation method for the unbalanced transportation problem

โœ Scribed by Nagraj Balakrishnan

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
205 KB
Volume
3
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

โœฆ Synopsis

Shimshak et al. [2] and Goyal [3] d es&be modifications to Vogel's Approximation Method for obtaining initial solutions to the unbalanced transportation problem. In this paper, we propose a further modification that could result in better initial solutions.

๐Ÿ“œ SIMILAR VOLUMES

A faster polynomial algorithm for the un
A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
โœ Ulrich Brenner ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 320 KB

We present a new algorithm for the Hitchcock transportation problem. On instances with n sources and k sinks, our algorithm has a worst-case running time of O(nk 2 (log n + k log k)). It closes a gap between algorithms with running time linear in n but exponential in k and a polynomialtime algorithm