Partitioning of biweighted trees
研究树形网络的分区问题，每条边有旅行时间和工作量两个权重，目标是最小化各区域的最大直径并均衡工作量，针对两区域和三区域分区提出了高效算法。
A districting problem is formulated as a network partitioning model where each link has one weight to denote travel time and another weight to denote workload. The objective of the problem is to minimize the maximum diameter of the districts while equalizing the workload among the districts. The case of tree networks is addressed and efficient algorithms are developed when the network is to be partitioned into two or three districts. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 143–158, 2002; DOI 10.1002/nav.10003