𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational experience with a polynomial-time dual simplex algorithm for the transportation problem

✍ Scribed by Yoshiro Ikura; George L. Nemhauser

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
572 KB
Volume
13
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ 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