The Weber problem in congested regions with entry and exit points
From MaRDI portal
Publication:337649
DOI10.1016/j.cor.2014.10.014zbMath1348.90417OpenAlexW2063063561MaRDI QIDQ337649
Cem Iyigun, Haldun Süral, Mohammad Saleh Farham
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.10.014
Related Items (2)
Generalization of the restricted planar location problems: unified metaheuristic algorithms ⋮ Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs
Cites Work
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- Finding rectilinear least cost paths in the presence of convex polygonal congested regions
- 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
- 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
- A reduction result for location problems with polyhedral barriers
- Unnamed Item
- Unnamed Item
This page was built for publication: The Weber problem in congested regions with entry and exit points
