arXiv Analytics

Sign in

arXiv:1212.6089 [math.OC]AbstractReferencesReviewsResources

Algebraic solution to a constrained rectilinear minimax location problem on the plane

Nikolai Krivulin

Published 2012-12-25Version 1

We consider a constrained minimax single facility location problem on the plane with rectilinear distance. The feasible set of location points is restricted to rectangles with sides oriented at a 45 degrees angle to the axes of Cartesian coordinates. To solve the problem, an algebraic approach based on an extremal property of eigenvalues of irreducible matrices in idempotent algebra is applied. A new algebraic solution is given that reduces the problem to finding eigenvalues and eigenvectors of appropriately defined matrices.

Comments: 2011 International Conference on Multimedia Technology (ICMT), 26-28 July 2011, Hangzhou, China. ISBN 978-1-61284-771-9
Journal: 2011 International Conference on Multimedia Technology (ICMT), IEEE, 2011, pp. 6212-6220
Categories: math.OC, cs.DM
Subjects: 15A80, 90B85, 65K05, 90C47, 15A18
Related articles: Most relevant | Search more
arXiv:1212.6085 [math.OC] (Published 2012-12-25)
Algebraic solutions to multidimensional minimax location problems with Chebyshev distance
arXiv:1210.4770 [math.OC] (Published 2012-10-17)
A new algebraic solution to multidimensional minimax location problems with Chebyshev distance
arXiv:1911.09700 [math.OC] (Published 2019-11-21)
Algebraic solution to constrained bi-criteria decision problem of rating alternatives through pairwise comparisons

Links

Toolbox