{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T00:53:11Z","timestamp":1702342391911},"reference-count":16,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2007,3,2]],"date-time":"2007-03-02T00:00:00Z","timestamp":1172793600000},"content-version":"vor","delay-in-days":11383,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1976,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This tutorial paper is concerned with network problems characterized as finding optimum paths in given networks and with synthesizing networks with given optimum paths. Optimum paths are best with respect to path weights where the path weights can represent such\u2010diverse path parameters as distances, costs, flows, or reliabilities. This paper surveys these problems and the known results by considering specific but simple generic examples while avoiding any detailed or rigorous proofs. The final example uses a mathematical equivalence and combines known optimum path results to obtain new results regarding the synthesis of optimum networks with specified point\u2010to\u2010point reliabilities.<\/jats:p>","DOI":"10.1002\/net.3230060402","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T03:18:37Z","timestamp":1178853517000},"page":"287-305","source":"Crossref","is-referenced-by-count":4,"title":["On optimum path problems"],"prefix":"10.1002","volume":"6","author":[{"given":"R. E.","family":"Thomas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,2]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/184873"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/0116001"},{"key":"e_1_2_1_6_2","unstructured":"Cockayne E. J.andD. G.Schiller Computation of Steiner Minimal Trees Proc. Oxford Conf. on Combinatorics and Graph Theory Dominic Welch ed. 1972."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_1_8_2","volume-title":"Graphs and Networks","author":"Price W. L.","year":"1971"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_2_1_11_2","volume-title":"Integer Programming and Network Flows","author":"Hu T. C.","year":"1969"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040204"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_14_2","first-page":"10","article-title":"Computer Solutions of the Traveling Salesman Problem","volume":"44","author":"Lin S.","year":"1965","journal-title":"BSTJ"},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1090\/qam\/265210","article-title":"Properties of the Distance Matrix of a Graph","volume":"26","author":"Boesch F.","year":"1969","journal-title":"Quart. Appl. Math."},{"key":"e_1_2_1_16_2","unstructured":"Boesch F. personal communication."},{"key":"e_1_2_1_17_2","unstructured":"Patrinos A. N. \u201cThe Distance Matrix of a Graph and its Tree Realization \u201d M.S. Thesis Northwestern University 1971."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230060402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230060402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T12:08:25Z","timestamp":1699790905000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230060402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,1]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1976,1]]}},"alternative-id":["10.1002\/net.3230060402"],"URL":"https:\/\/doi.org\/10.1002\/net.3230060402","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,1]]}}}