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

DOI10.1145/355900.355910MaRDI QIDQ3882152zbMATH OpenOpenAlexFDO

Authors 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

logisticsminimum-cut approachmultifacility location problemrectilinear distancesolution method

Mathematics Subject Classification ID

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

Cited in

(5)

• A faster parametric minimum-cut algorithm
• The least element property of center location on tree networks with applications to distance and precedence constrained problems
• 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

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

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