Planar location problems with block distance and barriers
From MaRDI portal
Publication:816413
DOI10.1007/s10479-005-2042-4zbMath1114.90056OpenAlexW2055672985MaRDI QIDQ816413
P. M. Dearing, Kathrin Klamroth, R. Segars jun.
Publication date: 9 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-2042-4
Related Items (10)
A cutting plane algorithm for the site layout planning problem with travel barriers ⋮ A planar single facility location and border crossing problem ⋮ Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm ⋮ Contour line construction for a new rectangular facility in an existing layout with rectangular departments ⋮ A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations ⋮ Conditional facility location problems with continuous demand and a polygonal barrier ⋮ Continuous location model of a rectangular barrier facility ⋮ Rectilinear distance to a facility in the presence of a square barrier ⋮ Successive computation of some efficient locations of the Weber problem with barriers ⋮ The rectilinear distance Weber problem in the presence of a probabilistic line barrier
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the definition and computation of rectilinear convex hulls
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- An efficient algorithm for facility location in the presence of forbidden regions
- Finding a region with the minimum total \(L_1\) distance from prescribed terminals
- Planar Weber location problems with barriers and block norms
- An equivalence result for single facility planar location problems with rectilinear distance and barriers
- Solving rectilinear planar location problems with barriers by a polynomial partitioning
- Planar weber location problems with line barriers
- On Some Distance Problems in Fixed Orientations
- A Bi-Objective Median Location Problem With a Line Barrier
- Finite-Size Facility Placement in the Presence of Barriers to Rectilinear Travel
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- Using Block Norms for Location Modeling
- Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- Dominating sets for rectilinear center location problems with polyhedral barriers
- Farthest neighbors and center points in the presence of rectngular obstacles
- A reduction result for location problems with polyhedral barriers
This page was built for publication: Planar location problems with block distance and barriers
