Minimizing Overshipments In Bottleneck Transportation Problems

DOI10.1080/03155986.1983.11731891MaRDI QIDQ3706788zbMATH OpenOpenAlexFDO

Authors Gerd Finke

Publication date 1983

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1983.11731891

zbMATH Keywords

Bottleneck transportation problemscapacity restrictionsovershipmentsprimal algorithm

Mathematics Subject Classification ID

Social choice (91B14)

Recommendations

• An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems
• An extension to the single bottleneck transportation problem
• Bottleneck capacitated transportation problem with bounds on rim conditions
• The multiple bottleneck transportation problem
• Reshipments and overshipments in transportation problems with minimax objective

Cited in

(3)

• A study of the bottleneck single source transportation problem
• Reshipments and overshipments in transportation problems with minimax objective
• Which matrices are immune against the transportation paradox?

This page was built for publication: Minimizing Overshipments In Bottleneck Transportation Problems

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