Locational optimization problems solved through Voronoi diagrams
From MaRDI portal
Publication:1278720
DOI10.1016/S0377-2217(97)80001-XzbMath0930.90059OpenAlexW2011450427MaRDI QIDQ1278720
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)80001-x
Related Items (20)
A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty ⋮ Distributed nonlinear Kalman filter with communication protocol ⋮ On the stability of Voronoi cells ⋮ Constrained clustering via diagrams: a unified theory and its application to electoral district design ⋮ Comparative error bound theory for three location models: continuous demand versus discrete demand ⋮ Spectral partitions for Sturm–Liouville problems ⋮ Solving continuous location-districting problems with Voronoi diagrams ⋮ Unnamed Item ⋮ Multi-outlet retail site location assessment ⋮ Static competitive facility location: an overview of optimisation approaches. ⋮ On bisectors for different distance functions ⋮ On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage ⋮ Spatially-distributed coverage optimization and control with limited-range interactions ⋮ A continuous analysis framework for the solution of location-allocation problems with dense demand ⋮ THE ANCHORED VORONOI DIAGRAM: STATIC, DYNAMIC VERSIONS AND APPLICATIONS ⋮ Maximin location: Discretization not always works ⋮ A multiplicatively-weighted Voronoi diagram approach to logistics districting ⋮ Performance of a class of multi-robot deploy and search strategies based on centroidal voronoi configurations ⋮ Heterogeneous locational optimisation using a generalised Voronoi partition ⋮ A Voronoi-based heuristic algorithm for locating distribution centers in disasters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- Geometric complexity of some location problems
- Linear facility location. Solving extensions of the basic problem
- A globally convergent algorithm for facility location on a sphere
- On the complexity of locating linear facilities in the plane
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- Computing largest empty circles with location constraints
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Minimax and maximin facility location problems on a sphere
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- A Solution to the Weber Location Problem on the Sphere
- APPROXIMATION OF A TESSELLATION OF THE PLANE BY A VORONOI DIAGRAM
- A Maxmin Location Problem
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- The Voronoi Partition of a Network and Its Implications in Location Theory
- 1-Segment Center Problems
- A computational method for optimizing the hierarchy and spatial configuration of successively inclusive facilities on a continuous plane
- Dynamic facility location: The progressive p-median problem
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Locational optimization problems solved through Voronoi diagrams
