The rectilinear distance Weber problem in the presence of a probabilistic line barrier
From MaRDI portal
Publication:1038385
DOI10.1016/j.ejor.2009.04.023zbMath1173.90447OpenAlexW1981962578MaRDI QIDQ1038385
George O. Wesolowsky, Mustafa S. Canbolat
Publication date: 17 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.04.023
Related Items (14)
A generalized Weber problem with different gauges for different regions ⋮ A cutting plane algorithm for the site layout planning problem with travel barriers ⋮ A planar single facility location and border crossing problem ⋮ Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm ⋮ Single facility siting involving allocation decisions ⋮ Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier ⋮ Integer linear programming models for grid-based light post location problem ⋮ A guided reactive GRASP for the capacitated multi-source Weber problem ⋮ 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 ⋮ Location models with stochastic demand points ⋮ Multicommodity flows and Benders decomposition for restricted continuous location problems ⋮ Rectilinear distance to a facility in the presence of a square barrier ⋮ Complexity results on planar multifacility location problems with forbidden regions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A wavefront approach to center location problems with barriers
- Planar location problems with block distance and barriers
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- Placing a finite size facility with a center objective on a rectangular plane with barriers
- Contour line construction for a new rectangular facility in an existing layout with rectangular departments
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- Distance estimation and collision prediction for on-line robotic motion planning
- An efficient algorithm for facility location in the presence of forbidden regions
- Locating a 1-center on a Manhattan plane with ``arbitrarily shaped barriers
- Algebraic properties of location problems with one circular barrier.
- Planar Weber location problems with barriers and block norms
- An equivalence result for single facility planar location problems with rectilinear distance and barriers
- Solving rectilinear planar location problems with barriers by a polynomial partitioning
- Planar weber location problems with line barriers
- A Bi-Objective Median Location Problem With a Line Barrier
- Finite-Size Facility Placement in the Presence of Barriers to Rectilinear Travel
- 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
- Dominating sets for rectilinear center location problems with polyhedral barriers
- 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: The rectilinear distance Weber problem in the presence of a probabilistic line barrier
