State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
综述了基于树形网络结构的选址问题，包括极小化极大和极小化总和问题、多目标选址、距离约束及路径选址，适合运筹学与网络优化研究者快速了解该领域进展。
The discussion of the fundamental p-center and p-median problems in Part I of this paper provides the basis for the work surveyed in Part II. Part II deals with the minimax and minisum location problems with mutual communication, location problems involving multiple objectives, the distance constraints problem and problems involving the location of paths. In addition, convexity issues in network location problems are discussed. Virtually all of this work exploits network structure. Specifically it is based on the assumption that the network is a tree. The conclusion section gives a brief discussion of the state of the art and of current trends in network location research.