A reduction result for location problems with polyhedral barriers
From MaRDI portal
Publication:5937710
DOI10.1016/S0377-2217(99)00399-9zbMath0981.90042OpenAlexW2075102802WikidataQ126654128 ScholiaQ126654128MaRDI QIDQ5937710
Publication date: 24 March 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00399-9
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
A unified model for Weber problems with continuous and network distances ⋮ An efficient solution method for Weber problems with barriers based on genetic algorithms ⋮ The Weber problem in congested regions with entry and exit points ⋮ A cutting plane algorithm for the site layout planning problem with travel barriers ⋮ A planar single facility location and border crossing problem ⋮ Generalization of the restricted planar location problems: unified metaheuristic algorithms ⋮ Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm ⋮ On the use of the varignon frame for single facility Weber problems in the presence of convex barriers ⋮ Algebraic properties of location problems with one circular barrier. ⋮ Genetic algorithm for obstacle location-allocation problems with customer priorities ⋮ Conditional facility location problems with continuous demand and a polygonal barrier ⋮ Multicommodity flows and Benders decomposition for restricted continuous location problems ⋮ Continuous location model of a rectangular barrier facility ⋮ The multi-facility location-allocation problem with polyhedral barriers ⋮ 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 ⋮ 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
Cites Work
- Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
- 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
- Multicriteria planar location problems
- Planar Weber location problems with barriers and block norms
- Planar weber location problems with line barriers
- A Bi-Objective Median Location Problem With a Line Barrier
- 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
- `` Direct Search Solution of Numerical and Statistical Problems
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
