Abstract / Description of output
We consider facility location problems where the demand is continuously and uniformly distributed over a convex polygon with m vertices in the rectilinear plane, n facilities are already present, and the goal is to find an optimal location for an additional facility. Based on an analysis of structural properties of incremental Voronoi diagrams, we develop polynomial exact algorithms for five conditional location problems. The developed methodology is applicable to a variety of other facility location problems with continuous demand. Moreover, we briefly discuss the Euclidean case.
| Original language | English |
|---|---|
| Pages (from-to) | 394-411 |
| Number of pages | 18 |
| Journal | Operations Research |
| Volume | 63 |
| Issue number | 2 |
| Early online date | 2 Mar 2015 |
| DOIs | |
| Publication status | Published - Mar 2015 |
Keywords / Materials (for Non-textual outputs)
- Continuous facilities location
- Covering problem
- Market share problem
- Median problem
- Voronoi diagrams
