A minimax single-facility location problem with rectilinear (Manhattan) metric is examined under constraints on the feasible location region, and a direct, explicit solution of the problem is suggested using methods of tropical (idempotent) mathematics. When no constraints are imposed, this problem, which is also known as the Rawls problem or the messenger boy problem, has known geometric and algebraic solutions. In the present article, a solution to the problem is investigated subject to constraints on the feasible region, which is given by a rectangular area. At first, the problem is represented in terms of tropical mathematics as a tropical optimization problem, a parameter is introduced to represent the minimum value of the obje...
The unconstrained model, and its solution technique can be easily modified to solve the limiting cas...
Abstract: "A globally convergent spatial branch-and-bound algorithm is given here which is shown to ...
In this paper we introduce a new objective function for the minimax location problem. Every demand p...
Methods of tropical (idempotent) mathematics are applied to the solution of minimax location problem...
This study describes algorithms for the solution of several single facility location problems with m...
A minimax two-facility location problem in multidimensional space with Chebyshev metric is examined...
This paper deals with the location of facilities or "movable" points on a planar area, on which ther...
The minimax facility location problem seeks for the optimal locations of the facilities in the plane...
This paper studies the problem of deciding whether the present iteration point of some algorithm app...
The single facility location problem in multiple regions with different norms (SMDN) generalizes the...
We study a facility location problem where a single facility serves multiple customers each represen...
textabstractThis paper studies the problem of deciding whether the present iteration point of some a...
The distance (the A-distance) which is determined by given orientations is proposed by P.Widmayer, Y...
Abstract Given demand points on a plane, we consider where a new facility should be located. In this...
In this work we consider the shortest path problem and the single facility Weber location problem in...
The unconstrained model, and its solution technique can be easily modified to solve the limiting cas...
Abstract: "A globally convergent spatial branch-and-bound algorithm is given here which is shown to ...
In this paper we introduce a new objective function for the minimax location problem. Every demand p...
Methods of tropical (idempotent) mathematics are applied to the solution of minimax location problem...
This study describes algorithms for the solution of several single facility location problems with m...
A minimax two-facility location problem in multidimensional space with Chebyshev metric is examined...
This paper deals with the location of facilities or "movable" points on a planar area, on which ther...
The minimax facility location problem seeks for the optimal locations of the facilities in the plane...
This paper studies the problem of deciding whether the present iteration point of some algorithm app...
The single facility location problem in multiple regions with different norms (SMDN) generalizes the...
We study a facility location problem where a single facility serves multiple customers each represen...
textabstractThis paper studies the problem of deciding whether the present iteration point of some a...
The distance (the A-distance) which is determined by given orientations is proposed by P.Widmayer, Y...
Abstract Given demand points on a plane, we consider where a new facility should be located. In this...
In this work we consider the shortest path problem and the single facility Weber location problem in...
The unconstrained model, and its solution technique can be easily modified to solve the limiting cas...
Abstract: "A globally convergent spatial branch-and-bound algorithm is given here which is shown to ...
In this paper we introduce a new objective function for the minimax location problem. Every demand p...