An improvement and an extension of the Elzinga & Hearn's algorithm to the 1-center problem in ℝ<Superscript>n</Superscript> withl <Subscript>2b</Subscript>-normswithl <Subscript>2b</Subscript>-norms
Year of publication: |
1996
|
---|---|
Authors: | Pelegrín, B. ; Cánovas, L. |
Published in: |
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. - Springer. - Vol. 4.1996, 2, p. 269-284
|
Publisher: |
Springer |
Subject: | Location | 1-Center | Cluster Analysis |
-
The location of superstores in Italy : a metric approach
Leogrande, Angelo, (2020)
-
Analyse factorielle lissée et analyse factorielle des différences locales
Benali, Habib, (1990)
-
ICT clusters in Europe : the great central banana and the small nordic potato
Koski, Heli, (2001)
- More ...
-
Algorithms for the decomposition of a polygon into convex polygons
Fernández, J., (2000)
-
A new assignment rule to improve seed points algorithms for the continuous k-center problem
Pelegrin, B., (1998)
-
DECOPOL - Codes for decomposing a polygon into convex subpolygons
Fernández, J., (1997)
- More ...