The Voronoi Partition of a Network and Its Implications in Location Theory
DOI10.1287/IJOC.4.4.412zbMATH Open0758.90052OpenAlexW2168409112MaRDI QIDQ4024312FDOQ4024312
Authors: S. Louis Hakimi, Martine Labbé, E. Schmeichel
Publication date: 25 February 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.4.4.412
Recommendations
Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Discrete location and assignment (90B80)
Cited In (16)
- Effectiveness-based Voronoi partition: a new tool for solving a class of location optimization problems
- The weighted farthest color Voronoi diagram on trees and graphs.
- Locational optimization problems solved through Voronoi diagrams
- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks
- Maximin location: Discretization not always works
- A Voronoi heuristic approach to dividing networks into equal-sized sub-networks
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
- Static competitive facility location: an overview of optimisation approaches.
- Comparative error bound theory for three location models: continuous demand versus discrete demand
- Capacity-constrained network-Voronoi diagram: a summary of results
- Balancing graph Voronoi diagrams with one more vertex
- Continuous-time moving network Voronoi diagram
- Aggregation error for location models: Survey and analysis
- The projection median of a set of points
- Finding the most relevant fragments in networks
- Title not available (Why is that?)
This page was built for publication: The Voronoi Partition of a Network and Its Implications in Location Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024312)