Given a set of points on the plane, we study the structure of their rectilinear hull. We also consider the multiple objective decision of identifying a facility location that minimizes the rectilinear distance to each of these points. We show specific correspondences between the efficient (non-dominated) solutions to the location problem and the rectilinear hulls of point sets in the plane
We study the problems of computing two non-convex enclosing shapes with the minimum area: the L-shap...
A minimax single-facility location problem with rectilinear (Manhattan) metric is examined under co...
This study describes algorithms for the solution of several single facility location problems with m...
AbstractSets of efficient points in a normed space with respect to the distances to the points of a ...
This paper deals with the kth nearest rectilinear distance of two regular point patterns: square and...
In this paper we deal with locating a line in the plane. If d is a distance measure our objective is...
A multicriteria location problem with rectilinear norm in Rn is considered. We propose an algorithm ...
AbstractIn a normed spaceX, we consider objective functions which depend on the distances between a ...
In this note we present geometrical characterizations for the set of efficient, weakly efficient and...
In this paper we characterize the set of efficient points in the planar point-objective location pro...
This paper deals with the location of facilities or "movable" points on a planar area, on which ther...
Three different classes of multiple points location-allocation problems in the Euclidean plane are ...
We present efficient algorithms for two problems of facility location. In both problems we want to o...
The anchored hyperplane location problem is to locate a hyperplane passing through some given points...
AbstractWe study the problems of computing two non-convex enclosing shapes with the minimum area; th...
We study the problems of computing two non-convex enclosing shapes with the minimum area: the L-shap...
A minimax single-facility location problem with rectilinear (Manhattan) metric is examined under co...
This study describes algorithms for the solution of several single facility location problems with m...
AbstractSets of efficient points in a normed space with respect to the distances to the points of a ...
This paper deals with the kth nearest rectilinear distance of two regular point patterns: square and...
In this paper we deal with locating a line in the plane. If d is a distance measure our objective is...
A multicriteria location problem with rectilinear norm in Rn is considered. We propose an algorithm ...
AbstractIn a normed spaceX, we consider objective functions which depend on the distances between a ...
In this note we present geometrical characterizations for the set of efficient, weakly efficient and...
In this paper we characterize the set of efficient points in the planar point-objective location pro...
This paper deals with the location of facilities or "movable" points on a planar area, on which ther...
Three different classes of multiple points location-allocation problems in the Euclidean plane are ...
We present efficient algorithms for two problems of facility location. In both problems we want to o...
The anchored hyperplane location problem is to locate a hyperplane passing through some given points...
AbstractWe study the problems of computing two non-convex enclosing shapes with the minimum area; th...
We study the problems of computing two non-convex enclosing shapes with the minimum area: the L-shap...
A minimax single-facility location problem with rectilinear (Manhattan) metric is examined under co...
This study describes algorithms for the solution of several single facility location problems with m...