The multiple bottleneck transportation problem

DOI10.1016/0305-0548(93)90003-2zbMath0793.90037OpenAlexW2024654495MaRDI QIDQ2367048

Mark H. Karwan, Bill jun. Wild, Kirk R. Karwan

Publication date: 16 August 1993

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

Full work available at URL: https://doi.org/10.1016/0305-0548(93)90003-2

zbMATH Keywords

Lagrangean relaxationbottleneck transportation problemdouble bounding technique

Mathematics Subject Classification ID

Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

The multiple bottleneck transportation problem, Multiple bottleneck assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• The multiple bottleneck transportation problem
• An efficient primal approach to bottleneck transportation problems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
• Time‐minimizing transportation problems
• The bottleneck transportation problem