An instant solution of the 2 × n bottleneck transportation problem

Authors:
Wlodzimierz Szwarc
Affiliations:
School of Business Administration, University of Wisconsin-Milwaukee, Milwaukee, Wisconsin 53201, USA
Venue:
Operations Research Letters
Year:
1993

Citing 1
Cited 1

An optimal algorithm for 2 × n bottleneck transportation problems

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

This paper provides an instant method to solve the 2 x n bottleneck transportation problem. It also compares the optimal solution structure of the bottleneck and the classical transportation models.