Rectilinear distance to a facility in the presence of a square barrier
From MaRDI portal
Publication:1761830
DOI10.1007/S10479-012-1063-ZzbMATH Open1251.90258OpenAlexW2084111074MaRDI QIDQ1761830FDOQ1761830
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1063-z
Cites Work
- Title not available (Why is that?)
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- The rectilinear distance Weber problem in the presence of a probabilistic line barrier
- 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
- Planar weber location problems with line barriers
- 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
- Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
- Finding minimum rectilinear distance paths in the presence of barriers
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- A reduction result for location problems with polyhedral barriers
- Locating a 1-center on a Manhattan plane with ``arbitrarily shaped barriers
- Algebraic properties of location problems with one circular barrier.
- A wavefront approach to center location problems with barriers
- Planar location problems with block distance and barriers
- Placing a finite size facility with a center objective on a rectangular plane with barriers
- The multi-facility location-allocation problem with polyhedral barriers
- 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
- Dominating sets for rectilinear center location problems with polyhedral barriers
- Supply facility and input/output point locations in the presence of barriers
- Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
Cited In (5)
- A cutting plane algorithm for the site layout planning problem with travel barriers
- Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm
- Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier
- A fast algorithm for the rectilinear distance location problem
- Continuous location model of a rectangular barrier facility
This page was built for publication: Rectilinear distance to a facility in the presence of a square barrier
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761830)
