Locational optimization problems solved through Voronoi diagrams
From MaRDI portal
Publication:1278720
DOI10.1016/S0377-2217(97)80001-XzbMATH Open0930.90059OpenAlexW2011450427MaRDI QIDQ1278720FDOQ1278720
Authors: Atsuyuki Okabe, Atsuo Suzuki 
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
Recommendations
- scientific article; zbMATH DE number 3889235
- scientific article; zbMATH DE number 3974683
- Structural properties of Voronoi diagrams in facility location problems with continuous demand
- Solving continuous location-districting problems with Voronoi diagrams
- scientific article; zbMATH DE number 1455125
Cites Work
- A note on two problems in connexion with graphs
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- A globally convergent algorithm for facility location on a sphere
- Minimax and maximin facility location problems on a sphere
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- Computing largest empty circles with location constraints
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Dynamic facility location: The progressive p-median problem
- A Maxmin Location Problem
- Title not available (Why is that?)
- Geometric complexity of some location problems
- The Voronoi Partition of a Network and Its Implications in Location Theory
- On the complexity of locating linear facilities in the plane
- Linear facility location. Solving extensions of the basic problem
- Title not available (Why is that?)
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- A computational method for optimizing the hierarchy and spatial configuration of successively inclusive facilities on a continuous plane
- APPROXIMATION OF A TESSELLATION OF THE PLANE BY A VORONOI DIAGRAM
- A Solution to the Weber Location Problem on the Sphere
- 1-Segment Center Problems
Cited In (31)
- Effectiveness-based Voronoi partition: a new tool for solving a class of location optimization problems
- A Voronoi-based heuristic algorithm for locating distribution centers in disasters
- On bisectors for different distance functions
- THE ANCHORED VORONOI DIAGRAM: STATIC, DYNAMIC VERSIONS AND APPLICATIONS
- An improved substation locating and sizing method based on the weighted Voronoi diagram and the transportation model
- A computational method for optimizing the shape and location of a polygon on a plane
- On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
- Maximin location: Discretization not always works
- A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty
- Performance of a class of multi-robot deploy and search strategies based on centroidal Voronoi configurations
- Heterogeneous, spatially distributed, limited range locational optimization: solved using generalized Voronoi decomposition
- Structural properties of Voronoi diagrams in facility location problems with continuous demand
- Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams
- Title not available (Why is that?)
- Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities
- Static competitive facility location: an overview of optimisation approaches.
- Comparative error bound theory for three location models: continuous demand versus discrete demand
- Distributed nonlinear Kalman filter with communication protocol
- Centroidal Power Diagrams, Lloyd's Algorithm, and Applications to Optimal Location Problems
- On the stability of Voronoi cells
- Title not available (Why is that?)
- Spectral partitions for Sturm-Liouville problems
- Solving the continuous space p-centre problem: planning application issues
- Solving continuous location-districting problems with Voronoi diagrams
- Heterogeneous locational optimisation using a generalised Voronoi partition
- A continuous analysis framework for the solution of location-allocation problems with dense demand
- Application of the theory of optimal set partitioning for constructing fuzzy Voronoi diagrams
- Spatially-distributed coverage optimization and control with limited-range interactions
- Constrained clustering via diagrams: a unified theory and its application to electoral district design
- A multiplicatively-weighted Voronoi diagram approach to logistics districting
- Multi-outlet retail site location assessment
This page was built for publication: Locational optimization problems solved through Voronoi diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278720)
