An optimal algorithm for 2 × n bottleneck transportation problems

Authors:
Ravi Varadarajan
Affiliations:
Computer and Information Sciences Department, University of Florida, Gainesville, FL 32611, USA
Venue:
Operations Research Letters
Year:
1991

Citing 2
Cited 3

The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Finding the median

Journal of Computer and System Sciences

On the role of bottleneck Monge matrices in combinatorial optimization

Operations Research Letters
An instant solution of the 2 × n bottleneck transportation problem

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

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bottleneck transportation problems differ from the standard transportation problems only in their objective function which is expressed as the maximum cost of shipping a commodity instead of as the sum of shipping costs. In this paper, we present a linear and hence an optimal algorithm for 2 x n bottleneck transportation problems.