Repositorio de producción científica de la Universidad de Sevilla

Improved results for the k-centrum straight-line location problem

 

Advanced Search
 
Opened Access Improved results for the k-centrum straight-line location problem
Cites
Show item statistics
Icon
Export to
Author: Lozano Palacio, Antonio José
Mesa López-Colmenar, Juan Antonio
Plastria, Frank
Date: 2004
Document type: Presentation
Abstract: The k-Centrum problem consists in finding a point that minimises the sum of the distances to the k farthest points out of a set of given points. It encloses as particular cases to two of the most known problems in Location Analysis: the center, also named as the minimum enclosing circle, and the median. In this paper the k-Centrum criteria is applied to obtaining a straight line-shaped facility. A reduced finite dominant set is determined and an algorithm with lower complexity than the previous one obtained.
Size: 98.24Kb
Format: PDF

URI: http://hdl.handle.net/11441/56018

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)