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 × n bottleneck transportation problems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
