Pages that link to "Item:Q4024312"
From MaRDI portal
The following pages link to The Voronoi Partition of a Network and Its Implications in Location Theory (Q4024312):
Displaying 14 items.
- Effectiveness-based Voronoi partition: a new tool for solving a class of location optimization problems (Q395840) (← links)
- Comparative error bound theory for three location models: continuous demand versus discrete demand (Q458944) (← links)
- The projection median of a set of points (Q1025289) (← links)
- Aggregation error for location models: Survey and analysis (Q1026594) (← links)
- Locational optimization problems solved through Voronoi diagrams (Q1278720) (← links)
- Maximin location: Discretization not always works (Q1284606) (← links)
- The weighted farthest color Voronoi diagram on trees and graphs. (Q1421027) (← links)
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) (Q1924622) (← links)
- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks (Q2827807) (← links)
- Finding the Most Relevant Fragments in Networks (Q3075611) (← links)
- Continuous-Time Moving Network Voronoi Diagram (Q3223928) (← links)
- A unified approach to network location problems (Q4934873) (← links)
- Static competitive facility location: an overview of optimisation approaches. (Q5928373) (← links)
- Balancing graph Voronoi diagrams with one more vertex (Q6196878) (← links)
