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.