Planar weber location problems with line barriers
From MaRDI portal
Publication:2743666
DOI10.1080/02331930108844547zbMath0995.90065OpenAlexW2037832510MaRDI QIDQ2743666
Publication date: 30 July 2002
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930108844547
Applications of mathematical programming (90C90) Continuous location (90B85) Nonconvex programming, global optimization (90C26)
Related Items (18)
Logistics distribution centers location problem and algorithm under fuzzy environment ⋮ Extensions to the Weber problem ⋮ 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 planar single facility location and border crossing problem ⋮ Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm ⋮ Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier ⋮ Algebraic properties of location problems with one circular barrier. ⋮ A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations ⋮ Facility location in normed linear spaces ⋮ Rectilinear distance to a facility in the presence of a square barrier ⋮ A reduction result for location problems with polyhedral barriers ⋮ Facility location models for distribution system design ⋮ Successive computation of some efficient locations of the Weber problem with barriers ⋮ Single facility collection depots location problem in the plane ⋮ The rectilinear distance Weber problem in the presence of a probabilistic line barrier ⋮ Some personal views on the current state and the future of locational analysis ⋮ Planar location problems with block distance and barriers
Cites Work
- Unnamed Item
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- Hull properties in location problems
- An efficient algorithm for facility location in the presence of forbidden regions
- Multicriteria planar location problems
- Combinatorial algorithms for some 1-facility median problems in the plane
- Optimal bin location and sequencing in printed circuit board assembly
- 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
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- Location Theory, Dominance, and Convexity
This page was built for publication: Planar weber location problems with line barriers
