Algebraic properties of location problems with one circular barrier.
From MaRDI portal
Publication:1420408
DOI10.1016/S0377-2217(02)00800-7zbMath1036.90045OpenAlexW2150420413MaRDI QIDQ1420408
Publication date: 2 February 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00800-7
Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (10)
An efficient solution method for Weber problems with barriers based on genetic algorithms ⋮ A planar single facility location and border crossing problem ⋮ 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 ⋮ A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations ⋮ Multicommodity flows and Benders decomposition for restricted continuous location problems ⋮ 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
- Unnamed Item
- Unnamed Item
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- GBSSS: The generalized big square small square method for planar single- facility location
- An efficient algorithm for facility location in the presence of forbidden regions
- Parallel concepts in graph theory
- Optimization. Algorithms and consistent approximations
- Planar Weber location problems with barriers and block norms
- Applications of random sampling in computational geometry. II
- Planar weber location problems with line barriers
- Algorithms for Reporting and Counting Geometric Intersections
- A Bi-Objective Median Location Problem With a Line Barrier
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- The Minisum and Minimax Location Problems Revisited
- 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
- An optimal algorithm for intersecting line segments in the plane
- Variational Analysis
- Dominating sets for rectilinear center location problems with polyhedral barriers
- On the continuous Weber and k -median problems (extended abstract)
- Farthest neighbors and center points in the presence of rectngular obstacles
- A reduction result for location problems with polyhedral barriers
- Supply facility and input/output point locations in the presence of barriers
This page was built for publication: Algebraic properties of location problems with one circular barrier.
