Minimax network location : theory and algorithms
Originally presented as the author's Ph. D. thesis, M.I.T. Dept. of Aeronautics and Astronautics, 1974
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Technical Report |
| Published: |
Cambridge, Mass. : Massachusetts Institute of Technology, Flight Transportation Laboratory, [1974]
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/67984 |
| _version_ | 1811092341809741824 |
|---|---|
| author | Handler, Gabriel Y. |
| author2 | Massachusetts Institute of Technology. Flight Transportation Laboratory |
| author_facet | Massachusetts Institute of Technology. Flight Transportation Laboratory Handler, Gabriel Y. |
| author_sort | Handler, Gabriel Y. |
| collection | MIT |
| description | Originally presented as the author's Ph. D. thesis, M.I.T. Dept. of Aeronautics and Astronautics, 1974 |
| first_indexed | 2024-09-23T15:16:41Z |
| format | Technical Report |
| id | mit-1721.1/67984 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T15:16:41Z |
| publishDate | 2012 |
| publisher | Cambridge, Mass. : Massachusetts Institute of Technology, Flight Transportation Laboratory, [1974] |
| record_format | dspace |
| spelling | mit-1721.1/679842019-04-12T15:07:59Z Minimax network location : theory and algorithms Handler, Gabriel Y. Massachusetts Institute of Technology. Flight Transportation Laboratory Network analysis (Planning) Graph theory Originally presented as the author's Ph. D. thesis, M.I.T. Dept. of Aeronautics and Astronautics, 1974 August 1974 Includes bibliographical references (leaves 122-126) 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 network respectively and let m denote the number of centers available. The categorization scheme P N/P N/m/G T, 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, P/P/m/G-for virtually any size of network. Moreover, tree problems can usually be solved manually. Methodologically, the tree-based results are graph-theoretic while the general case, formulated in a mathematical programming framework, leads to a highly efficient strategy for a class of massive generalized set covering problems. 2012-01-06T06:57:11Z 2012-01-06T06:57:11Z 1974 Technical Report 02394594 http://hdl.handle.net/1721.1/67984 FTL report (Massachusetts Institute of Technology. Flight Transportation Laboratory) ; R74-4 140 leaves application/pdf Cambridge, Mass. : Massachusetts Institute of Technology, Flight Transportation Laboratory, [1974] |
| spellingShingle | Network analysis (Planning) Graph theory Handler, Gabriel Y. Minimax network location : theory and algorithms |
| title | Minimax network location : theory and algorithms |
| title_full | Minimax network location : theory and algorithms |
| title_fullStr | Minimax network location : theory and algorithms |
| title_full_unstemmed | Minimax network location : theory and algorithms |
| title_short | Minimax network location : theory and algorithms |
| title_sort | minimax network location theory and algorithms |
| topic | Network analysis (Planning) Graph theory |
| url | http://hdl.handle.net/1721.1/67984 |
| work_keys_str_mv | AT handlergabriely minimaxnetworklocationtheoryandalgorithms |