Open AccessState of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
Author(s) -
Barbaros Ç. Tansel,
Richard L. Francis,
Timothy J. Lowe
Publication year - 1983
Publication title -
management science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 4.954
H-Index - 255
eISSN - 1526-5501
pISSN - 0025-1909
DOI - 10.1287/mnsc.29.4.498
Subject(s) - computer science , minimax , tree network , convexity , facility location problem , tree (set theory) , state (computer science) , exploit , 1 center problem , work (physics) , location model , basis (linear algebra) , operations research , mathematical optimization , mathematics , algorithm , computer security , time complexity , engineering , combinatorics , mechanical engineering , geometry , financial economics , economics
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.facilities/equipment planning: location