A study of the bottleneck single source transportation problem

DOI10.1016/0305-0548(84)90005-4zbMath0606.90089OpenAlexW2001148395MaRDI QIDQ1085063

Gerald L. Thompson, Robert V. Nagelhout

Publication date: 1984

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(84)90005-4

zbMATH Keywords

heuristic methodComputational experiencerandomly generated problemsBottleneck Single Source Transportation

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)

Heuristic methods and applications: A categorized survey

Cites Work

• Unnamed Item
• Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
• A branch and bound algorithm for the generalized assignment problem
• Bottleneck Linear Programming
• Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
• Modeling Facility Location Problems as Generalized Assignment Problems
• An all Zero-One Algorithm for a Certain Class of Transportation Problems
• Some remarks on the time transportation problem
• Time‐minimizing transportation problems
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
• An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems
• The bottleneck transportation problem

This page was built for publication: A study of the bottleneck single source transportation problem