Efficient Algorithms for the Hitchcock Transportation Problem

DOI10.1137/S0097539792236729zbMath0831.68109OpenAlexW1985901118MaRDI QIDQ4842121

Jun Nakano, Takeshi Tokuyama

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

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

Related Items (4)

Tropical medians by transportation ⋮ Using combinatorial optimization in model-based trimmed clustering with cardinality constraints ⋮ A faster polynomial algorithm for the unbalanced Hitchcock transportation problem ⋮ Geometric quadrisection in linear time, with application to VLSI placement

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