[[abstract]]Given n demand points with positive weights on the plane, the weightedrectilinearm-centerproblem is to determine m service points so as to minimize the maximum of weightedrectilinear distances from demand points to their respective nearest service points. In this paper, we propose O(n) algorithms for the weightedrectilinear2-centerand3-center decision problems, andO(nlogn) algorithms for the weightedrectilinear2-centerand3-center optimization problems.[[fileno]]2030256010050[[department]]資訊工程學
AbstractThis paper revisits an early but interesting optimal algorithm first proposed by Drezner to ...
Introduction In this chapter, we would like to find optimal (or approximately optimal) locations fo...
Given a set P of n points in the plane and a multiset W of k weights with k <= n, we assign each wei...
algorithm for the problem of finding a point (x, y) in the plane that minimizes the maximal weighted...
We present efficient algorithms for two problems of facility location. In both problems we want to o...
The notion of weighted centers is essential in V-space interior-point algorithms for linear programm...
The feasibility problem for a system of linear inequalities can be converted into an unconstrained o...
[[abstract]]©1990 Elsevier-Considers the unweighted m-center problem with rectilinear distance. The ...
. The feasibility problem for a system of linear inequalities can be converted into an unconstrained...
AbstractIn this paper, the weighted tailored 2-partition problem and the weighted 2-center problem u...
Abstract. The feasibility problem for a system of linear inequalities can be converted into an uncon...
[[abstract]]Given a set of n points on the plane, the rectilinear m-center problem is to find n rect...
In the paper of Liao and Todd [3] two weighted centers are introduced and used to design algorithms ...
Abstract — In this paper, we consider the weighted rectilinear min-sum facility problem to minimize ...
AbstractGiven n demand points in the plane, the p-centre problem is to locate p supply points so as ...
AbstractThis paper revisits an early but interesting optimal algorithm first proposed by Drezner to ...
Introduction In this chapter, we would like to find optimal (or approximately optimal) locations fo...
Given a set P of n points in the plane and a multiset W of k weights with k <= n, we assign each wei...
algorithm for the problem of finding a point (x, y) in the plane that minimizes the maximal weighted...
We present efficient algorithms for two problems of facility location. In both problems we want to o...
The notion of weighted centers is essential in V-space interior-point algorithms for linear programm...
The feasibility problem for a system of linear inequalities can be converted into an unconstrained o...
[[abstract]]©1990 Elsevier-Considers the unweighted m-center problem with rectilinear distance. The ...
. The feasibility problem for a system of linear inequalities can be converted into an unconstrained...
AbstractIn this paper, the weighted tailored 2-partition problem and the weighted 2-center problem u...
Abstract. The feasibility problem for a system of linear inequalities can be converted into an uncon...
[[abstract]]Given a set of n points on the plane, the rectilinear m-center problem is to find n rect...
In the paper of Liao and Todd [3] two weighted centers are introduced and used to design algorithms ...
Abstract — In this paper, we consider the weighted rectilinear min-sum facility problem to minimize ...
AbstractGiven n demand points in the plane, the p-centre problem is to locate p supply points so as ...
AbstractThis paper revisits an early but interesting optimal algorithm first proposed by Drezner to ...
Introduction In this chapter, we would like to find optimal (or approximately optimal) locations fo...
Given a set P of n points in the plane and a multiset W of k weights with k <= n, we assign each wei...