A time minimising transportation problem with quantity dependent time

DOI10.1016/0377-2217(81)90351-9zbMath0455.90056OpenAlexW2016440292MaRDI QIDQ1150308

C. R. Seshan, K. K. Achary

Publication date: 1981

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(81)90351-9

zbMATH Keywords

branch and bound algorithmthreshold algorithmcomputation of minimum bottleneck shipmentprimal dual approachquantity dependent timetime minimising transportation problemupper bounding technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

The stochastic bottleneck linear programming problem

Cites Work

• A procedure for time minimization transportation problem
• An augmenting path method for solving linear bottleneck transportation problems
• Transportation type problems with quantity discounts
• Some remarks on the time transportation problem
• Time‐minimizing transportation problems
• Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
• The bottleneck transportation problem
• Unnamed Item

This page was built for publication: A time minimising transportation problem with quantity dependent time