A linear time algorithm for the unbalanced Hitchcock transportation problem

DOI10.1002/NET.21668MaRDI QIDQ4642426zbMATH OpenOpenAlexFDO

Authors Rudolf Scheifele, Tomomi Matsui

Publication date 23 May 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21668

zbMATH Keywords

bipartite graphHitchcock transportation problemlinear time algorithmminimum cost flow problemparallel edgesrecursive algorithm

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
• scientific article; zbMATH DE number 742962
• Transportation problems which can be solved by the use of hirsch-paths for the dual problems
• Efficient Algorithms for the Hitchcock Transportation Problem
• Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs

Cited in

(3)

• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
• scientific article; zbMATH DE number 742962 (Why is no real title available?)
• Efficient Algorithms for the Hitchcock Transportation Problem

This page was built for publication: A linear time algorithm for the unbalanced Hitchcock transportation problem

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