We call this problem an extensive 1-median problem with radius on networks. To solve the problem, we first induce the so-called finite dominating set, that contains all points on the underlying network and radius values which are candidate for the optimal solution of the ...
We consider in this paper the inverse 1-median problem on trees with variable vertex weights, which are partitioned into groups. While the modifications in each group are measured by Chebyshev norm, rectilinear norm is applied for computing the cost of groups; and vice versa. As a result, it...
The classical location problem is a special instance of the round-trip and one-way location problems, where every customer also coincides with a depot. When the number p of servers is an arbitrary positive integer, the classical p-center and p-median problems on general graphs are NP-hard [...
http://codeforces.com/contest/1005/problem/E1题目 https://blog.csdn.net/haipai1998/article/details/80985281原博客 对样例1: 5 4 2 4 5 3 1 m=4,所以下标pos=2; 从pos往右遇到比m大的就cnt++,遇到小的就cnt--: 刚开始cnt=0; mp[cnt]++ ...
The problem of locating an undesirable facility on a network with n nodes and m edges so as to maximize its total weighted distance to all nodes is addressed. We propose a new upper bound to the problem. Likewise, we develop a new algorithm in O( mn) time which dynamically updates this...
In the 1-median problem with probabilistic demand the objective is to find a location of a desirable facility on a network that maximizes the probability that the weighted sum distance does not exceed some pre-determined value T. In the 1-antimedian problem the objective is to locate an ...
The robust 1-median on a tree problem, as introduced in Chapter 2, addresses the location of a single facility on a tree network in the presence of significant uncertainty in the node weights (node demands) and edge lengths (transportation cost). Uncertainty is modeled with the use of ...
Consider the problem of finding a point in a metric space $(\\{1,2,\\ldots,n\\},d)$ with the minimum average distance to other points. We show that this problem has no deterministic $o(n^{1+1/(h-1)})$-query $(2h-\\Omega(1))$-approximation algorithms for any constant $h\...
Solving 0-1 knapsack problem based on ant colony optimization algorithm; 基于蚁群优化算法的0-1背包问题求解 更多例句>> 6) one-dimensional C1 problem 一维C~1问题补充资料:50%median effective dose 分子式:CAS号:性质:能使50%的个体产生阳性效果的剂量。 说明:补充资料仅用于学习参考,请勿用于其它任何...
We study the problem of designing a three level hub network where the top level consists of a complete network connecting the so-called central hubs and the second and third levels are unions of star networks connecting the remaining hubs to central hubs and the demand centers to hubs and cen...