On the use of the varignon frame for single facility Weber problems in the presence of convex barriers
From MaRDI portal
Publication:439364
DOI10.1016/j.ejor.2011.09.006zbMath1244.90124OpenAlexW2094808950MaRDI QIDQ439364
Mustafa S. Canbolat, George O. Wesolowsky
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.09.006
Related Items (6)
Generalization of the restricted planar location problems: unified metaheuristic algorithms ⋮ Single facility siting involving allocation decisions ⋮ Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier ⋮ A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations ⋮ An algorithm for generalized constrained multi-source Weber problem with demand substations ⋮ Conditional facility location problems with continuous demand and a polygonal barrier
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- The rectilinear distance Weber problem in the presence of a probabilistic line barrier
- 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
- Algebraic properties of location problems with one circular barrier.
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- 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
This page was built for publication: On the use of the varignon frame for single facility Weber problems in the presence of convex barriers
