A time minimising transportation problem with quantity dependent time

DOI10.1016/0377-2217(81)90351-9MaRDI QIDQ1150308zbMATH OpenOpenAlexFDO

Authors K. K. Achary, C. R. Seshan

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)

Cites work

• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• A procedure for time minimization transportation problem
• An augmenting path method for solving linear bottleneck transportation problems
• Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
• Some remarks on the time transportation problem
• The bottleneck transportation problem
• Time‐minimizing transportation problems
• Transportation type problems with quantity discounts

Cited in

(1)

• The stochastic bottleneck linear programming problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1150308)