Efficient Algorithms for the Hitchcock Transportation Problem

DOI10.1137/S0097539792236729MaRDI QIDQ4842121zbMATH OpenOpenAlexFDO

Authors Takeshi Tokuyama, Jun Nakano

Publication date 13 February 1996

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539792236729

zbMATH Keywords

Hitchcock transportation problemsplitter finding

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs
• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
• A linear time algorithm for the unbalanced Hitchcock transportation problem
• POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS

Cited in

(10)

• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
• Geometric quadrisection in linear time, with application to VLSI placement
• Using geometry to solve the transportation problem in the plane
• Algorithms for the minimax transportation problem
• A linear time algorithm for the unbalanced Hitchcock transportation problem
• scientific article; zbMATH DE number 742962 (Why is no real title available?)
• Efficient Algorithms for Airline Problem
• Tropical medians by transportation
• Tropical convexity in location problems
• Using combinatorial optimization in model-based trimmed clustering with cardinality constraints

This page was built for publication: Efficient Algorithms for the Hitchcock Transportation Problem

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