A faster polynomial algorithm for the unbalanced Hitchcock transportation problem

Authors:
Ulrich Brenner
Affiliations:
Research Institute for Discrete Mathematics, University of Bonn, Lennéstr. 2, 53113 Bonn, Germany
Venue:
Operations Research Letters
Year:
2008

Citing 13
Cited 2

An O(n) algorithm for the linear multiple choice knapsack problem and related problems

Information Processing Letters
Finding minimum-cost circulations by successive approximation

Mathematics of Operations Research
Geometric algorithms for a minimum cost assignment problem

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A faster strongly polynomial minimum cost flow algorithm

Operations Research
Improved Algorithms for Bipartite Network Flow

SIAM Journal on Computing
Efficient Algorithms for the Hitchcock Transportation Problem

SIAM Journal on Computing
A strongly polynomial algorithm for the transportation problem

Mathematical Programming: Series A and B
Faster and better global placement by a new transportation algorithm

Proceedings of the 42nd annual Design Automation Conference
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms
Time bounds for selection

Journal of Computer and System Sciences
Geometric quadrisection in linear time, with application to VLSI placement

Discrete Optimization
Linear time algorithms for some separable quadratic programming problems

Operations Research Letters
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources

Operations Research Letters

Minimizing electricity cost: optimization of distributed internet data centers in a multi-electricity-market environment

INFOCOM'10 Proceedings of the 29th conference on Information communications
Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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(logn+klogk)). It closes a gap between algorithms with running time linear in n but exponential in k and a polynomial-time algorithm with running time O(nk^2log^2n).