Conditional facility location problems with continuous demand and a polygonal barrier
From MaRDI portal
Publication:2239930
DOI10.1016/j.ejor.2021.02.032zbMath1487.90432OpenAlexW3131901891MaRDI QIDQ2239930
Publication date: 5 November 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.02.032
Related Items (2)
Optimization models for cloud seeding network design and operations ⋮ Efficient presolving methods for solving maximal covering and partial set covering location problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the use of the varignon frame for single facility Weber problems in the presence of convex barriers
- A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
- Planar location problems with block distance and barriers
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- The general optimal market area model
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Multicommodity flows and Benders decomposition for restricted continuous location problems
- A polynomial time dual algorithm for the Euclidean multifacility location problem
- Regional service coverage modeling
- The minimum weighted covering location problem with distance constraints
- Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons
- An efficient algorithm for the location-allocation problem with rectangular regions
- The p-center location problem in an area
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- Scheduling, Location, Transportation, and Continuum Mechanics: Some Simple Approximations to Optimization Problems
- Dominating sets for rectilinear center location problems with polyhedral barriers
- Location Science
- On the Continuous Fermat-Weber Problem
- Solving the continuous space p-centre problem: planning application issues
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- A reduction result for location problems with polyhedral barriers
This page was built for publication: Conditional facility location problems with continuous demand and a polygonal barrier
