The rectilinear distance minisum problem with minimum distance constraints:

DOI10.1016/0966-8349(95)00015-1zbMATH Open0916.90187OpenAlexW1969409802MaRDI QIDQ4229652FDOQ4229652

Author name not available (Why is that?)

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-boundtransportation costssingle facilityrectilinear normsocial costscontinuous plane

Mathematics Subject Classification ID

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

Cited In (8)

• On Romeo and Juliet problems: minimizing distance-to-sight
• Fast approximations for sums of distances, clustering and the Fermat-Weber problem
• Optimization of the norm of a vector-valued DC function and applications
• The range co-minima problem
• On a binary distance model for the minimum linear arrangement problem
• Improved algorithms for placing undesirable facilities
• Minisum location problem with farthest Euclidean distances
• A Deterministic Reduction for the Gap Minimum Distance Problem

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

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