Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances
Nikolai Krivulin

TL;DR
This paper presents an algebraic method using tropical (idempotent) algebra to find exact, closed-form solutions for constrained minimax single-facility location problems with Chebyshev and rectilinear distances, applicable in multidimensional spaces.
Contribution
It introduces a novel algebraic framework that reduces complex location problems to systems of inequalities, enabling efficient, exact solutions in polynomial time.
Findings
Provides a compact closed-form solution for Chebyshev location problems.
Extends solutions to rectilinear distance problems in two-dimensional space.
Achieves polynomial time complexity for the solution process.
Abstract
We consider location problems to find the optimal sites of placement of a new facility, which minimize the maximum weighted Chebyshev or rectilinear distance to existing facilities under constraints on a feasible location domain. We examine Chebyshev location problems in multidimensional space to represent and solve the problems in the framework of tropical (idempotent) algebra, which deals with the theory and applications of semirings and semifields with idempotent addition. The solution approach involves formulating the problem as a tropical optimization problem, introducing a parameter that represents the minimum value of the objective function in the problem, and reducing the problem to a system of parametrized inequalities. The necessary and sufficient conditions for the existence of a solution to the system serve to evaluate the minimum, whereas all corresponding solutions of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
