The rectilinear distance minisum problem with minimum distance constraints:

DOI10.1016/0966-8349(95)00015-1zbMath0916.90187OpenAlexW1969409802MaRDI QIDQ4229652

No author found.

Publication date: 22 February 1999

Published in: Location Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0966-8349(95)00015-1

zbMATH Keywords

branch-and-boundsingle facilitytransportation costsrectilinear normsocial costscontinuous plane

Mathematics Subject Classification ID

Continuous location (90B85) Discrete location and assignment (90B80)

Related Items (3)

Improved algorithms for placing undesirable facilities ⋮ Optimization of the norm of a vector-valued DC function and applications ⋮ Fast approximations for sums of distances, clustering and the Fermat-Weber problem

This page was built for publication: The rectilinear distance minisum problem with minimum distance constraints: