Single facility collection depots location problem in the plane (Q1025297)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Single facility collection depots location problem in the plane |
scientific article; zbMATH DE number 5566423
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single facility collection depots location problem in the plane |
scientific article; zbMATH DE number 5566423 |
Statements
Single facility collection depots location problem in the plane (English)
0 references
18 June 2009
0 references
Minmax and minsum variants of the planar Euclidean collection depots location problem are studied. The authors show as to how Voronoi diagrams can be used to enumerate candidate solutions to these problems and how their use yields an improved algorithm for solving a type of MinSum problem with line barriers and its generalization [cf. \textit{K. Klamroth}, Optimization 49, No.~5--6, 517--527 (2001; Zbl 0995.90065)]. A solution to an open problem posed by \textit{Z. Drezner} [Eur. J. Oper. Res. 130, No.~3, 510--518 (2001; Zbl 0981.90040)] is also given.
0 references
facility location
0 references
minmax
0 references
minsum
0 references
Voronoi diagram
0 references
approximation algorithms
0 references
coresets
0 references
