arXiv Analytics

Sign in

arXiv:1212.6085 [math.OC]AbstractReferencesReviewsResources

Algebraic solutions to multidimensional minimax location problems with Chebyshev distance

Nikolai Krivulin

Published 2012-12-25Version 1

Multidimensional minimax single facility location problems with Chebyshev distance are examined within the framework of idempotent algebra. A new algebraic solution based on an extremal property of the eigenvalues of irreducible matrices is given. The solution reduces both unconstrained and constrained location problems to evaluation of the eigenvalue and eigenvectors of an appropriate matrix.

Comments: International Conference on Applied and Computational Mathematics (ICACM'11), Lanzarote, Canary Islands, Spain, May 27-29, 2011, WSEAS Press. ISBN 978-1-61804-002-2
Journal: Recent Researches in Applied and Computational Mathematics: Intern. Conf. on Applied and Computational Mathematics (ICACM'11), 2011, pp. 157-162
Categories: math.OC, cs.DM
Subjects: 15A80, 90B85, 65K05, 90C47, 15A18
Related articles: Most relevant | Search more
arXiv:1210.4770 [math.OC] (Published 2012-10-17)
A new algebraic solution to multidimensional minimax location problems with Chebyshev distance
arXiv:1211.2425 [math.OC] (Published 2012-11-11)
An algebraic approach to multidimensional minimax location problems with Chebyshev distance
arXiv:1212.6089 [math.OC] (Published 2012-12-25)
Algebraic solution to a constrained rectilinear minimax location problem on the plane

Links

Toolbox