On the accuracy of demand point solutions to the planar, Manhattan metric, p-median problem, with and without barriers to travel
From MaRDI portal
Publication:1099772
DOI10.1016/0305-0548(88)90038-XzbMath0638.90033OpenAlexW2076834352MaRDI QIDQ1099772
Publication date: 1988
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(88)90038-x
random locationsaccuracy of demand point solutionsclustered locationsimpenetrable barriers to travelplanar, Manhattan metric, p-median problemtight worst case bounds
Related Items (2)
An efficient solution method for Weber problems with barriers based on genetic algorithms ⋮ Public facility location using dispersion, population, and equity criteria
Cites Work
- Mixed planar/network facility location problems
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
- Finding minimum rectilinear distance paths in the presence of barriers
- On Insensitivities in Urban Redistricting and Facility Location
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: On the accuracy of demand point solutions to the planar, Manhattan metric, p-median problem, with and without barriers to travel
