An optimal algorithm for 2×n bottleneck transportation problems

An optimal algorithm for 2×n bottleneck transportation problems

0.00 Avg rating0 Votes
Article ID: iaor19921946
Country: Netherlands
Volume: 10
Issue: 9
Start Page Number: 525
End Page Number: 529
Publication Date: Dec 1991
Journal: Operations Research Letters
Authors:
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. This paper presents a linear and hence an optimal algorithm for 2×n bottleneck transportation problems.

Reviews

Required fields are marked *. Your email address will not be published.