Minimax Network Location: Theory and Algorithms.
MASSACHUSETTS INST OF TECH CAMBRIDGE OPERATIONS RESEARCH CENTER
Pagination or Media Count:
For a given network let P and N denote the set of all points and the set of all nodes respectively. Let G and T denote a cyclic network and a tree respectively and let m denote the number of centers available. The categorization scheme where the first and second cells refer to the possible locations of centers and demand generating points respectively, provides for compact identification of a variety of minimax network location problems. This dissertation presents algorithms which efficiently solve all problems in this class--for example, PPmG-for virtually any size of network. Moreover, tree problems can usually be solved manually.
- Operations Research