A reduction result for location problems with polyhedral barriers
From MaRDI portal
Recommendations
- The multi-facility location-allocation problem with polyhedral barriers
- Planar location problems with block distance and barriers
- Solving rectilinear planar location problems with barriers by a polynomial partitioning
- scientific article; zbMATH DE number 1855792
- An equivalence result for single facility planar location problems with rectilinear distance and barriers
Cites work
- `` Direct Search Solution of Numerical and Statistical Problems
- A Bi-Objective Median Location Problem With a Line Barrier
- An efficient algorithm for facility location in the presence of forbidden regions
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
- Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
- Multicriteria planar location problems
- Planar Weber location problems with barriers and block norms
- Planar weber location problems with line barriers
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
Cited in
(24)- The rectilinear distance Weber problem in the presence of a probabilistic line barrier
- Algebraic properties of location problems with one circular barrier.
- A cutting plane algorithm for the site layout planning problem with travel barriers
- Generalization of the restricted planar location problems: unified metaheuristic algorithms
- Multicommodity flows and Benders decomposition for restricted continuous location problems
- Rectilinear distance to a facility in the presence of a square barrier
- 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
- Genetic algorithm for obstacle location-allocation problems with customer priorities
- Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm
- Conditional facility location problems with continuous demand and a polygonal barrier
- A unified model for Weber problems with continuous and network distances
- Successive computation of some efficient locations of the Weber problem with barriers
- The Weber problem in congested regions with entry and exit points
- A planar single facility location and border crossing problem
- A Bi-Objective Median Location Problem With a Line Barrier
- On the use of the varignon frame for single facility Weber problems in the presence of convex barriers
- Continuous location model of a rectangular barrier facility
- Multiple obnoxious facility location: the case of protected areas
- A wavefront approach to center location problems with barriers
- A continuous location-allocation problem with zone-dependent fixed cost
- Planar location problems with block distance and barriers
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- The multi-facility location-allocation problem with polyhedral barriers
This page was built for publication: A reduction result for location problems with polyhedral barriers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5937710)
