Algebraic solutions to multidimensional minimax location problems with Chebyshev distance
Algebraic solutions to multidimensional minimax location problems with Chebyshev distance
复制标题
DOI：
--
复制
发表时间：
2011-05
期刊：
影响因子：
--
通讯作者：
N. Krivulin
中科院分区：
文献类型：
--
作者：
N. Krivulin
在幂等代数的框架下研究了具有Chebyshev距离的多维Minimax单设施选址问题。基于不可约矩阵特征值的极值性质，给出了一种新的代数解法。该解决方案减少了无约束和有约束的位置问题，以评估一个适当的矩阵的特征值和特征向量。
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.