The Voronoi Partition of a Network and Its Implications in Location Theory

DOI10.1287/IJOC.4.4.412MaRDI QIDQ4024312zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

polynomial timeVoronoi partitionsize of a territory

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Discrete location and assignment (90B80)

Recommendations

• A Voronoi heuristic approach to dividing networks into equal-sized sub-networks
• Full ordering Voronoi sets for bi-facility bicriterium (max, sum) location on networks
• Voronoi game on graphs
• An \(O(mn)\) algorithm for the 1-maximin problem on a network
• Voronoi game on graphs

Cited in

(16)

• Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks
• 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.
• Finding the most relevant fragments in networks
• Aggregation error for location models: Survey and analysis
• The projection median of a set of points
• An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
• Balancing graph Voronoi diagrams with one more vertex
• Locational optimization problems solved through Voronoi diagrams
• scientific article; zbMATH DE number 1394671 (Why is no real title available?)
• A Voronoi heuristic approach to dividing networks into equal-sized sub-networks
• Capacity-constrained network-Voronoi diagram: a summary of results
• Maximin location: Discretization not always works
• Comparative error bound theory for three location models: continuous demand versus discrete demand
• Continuous-time moving network Voronoi diagram
• Static competitive facility location: an overview of optimisation approaches.

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)