Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach

DOI10.1145/355900.355910zbMath0439.90022OpenAlexW2047710434MaRDI QIDQ3882152

To-yat Cheung

Publication date: 1980

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/355900.355910

zbMATH Keywords

logisticsmultifacility location problemsolution methodrectilinear distanceminimum-cut approach

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)

Related Items (5)

Sufficient conditions for coincidence in \(\ell_ 1\)-minisum multifacility location problems ⋮ A multifacility location problem on median spaces ⋮ Duality for constrained multifacility location problems with mixed norms and applications ⋮ A faster parametric minimum-cut algorithm ⋮ The least element property of center location on tree networks with applications to distance and precedence constrained problems

This page was built for publication: Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach