{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T11:52:04Z","timestamp":1716378724608},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5768,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1016\/s0166-218x(97)00008-5","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"89-102","source":"Crossref","is-referenced-by-count":4,"title":["Paths with minimum range and ratio of arc lengths"],"prefix":"10.1016","volume":"78","author":[{"given":"Pierre","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Giovanni","family":"Storchi","sequence":"additional","affiliation":[]},{"given":"Tsevi","family":"Vovor","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0166-218X(97)00008-5_BIB1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0305-0548(88)90031-7","article-title":"Minimum cost-reliability ratio path problem","volume":"15","author":"Ahuja","year":"1988","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(97)00008-5_BIB2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1287\/mnsc.32.8.909","article-title":"A survey of exact algorithms for the simple assembly line balancing problem","volume":"32","author":"Baybars","year":"1986","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(97)00008-5_BIB3","series-title":"Graphes et hypergraphes Dunod, Paris, 1970","author":"Berge","year":"1973"},{"key":"10.1016\/S0166-218X(97)00008-5_BIB4","series-title":"Theory of Graphs Paris","first-page":"77","article-title":"Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem","author":"Dantzig","year":"1967"},{"key":"10.1016\/S0166-218X(97)00008-5_BIB5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/S0166-218X(97)00008-5_BIB6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1109\/TCOM.1963.1088752","article-title":"Optimum routes in communication systems with channel capacities and channel reliabilities","author":"Frisch","year":"1963","journal-title":"IEEE Trans. Comm. Systems CS-11"},{"key":"10.1016\/S0166-218X(97)00008-5_BIB7","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/BFb0121087","article-title":"Shortest path methods: a unifying approach","volume":"26","author":"Gallo","year":"1986","journal-title":"Math. Programming Stud."},{"key":"10.1016\/S0166-218X(97)00008-5_BIB8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02288320","article-title":"Shortest path algorithms","volume":"13","author":"Gallo","year":"1988","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(97)00008-5_BIB9","series-title":"Shortest paths: a bibliography, Quaderni SOFMAT, doc.num.81-Pl-4-SOFMAT-27","author":"Gallo","year":"1982"},{"key":"10.1016\/S0166-218X(97)00008-5_BIB10","series-title":"Multiple Criteria Decision Making: Theory and Applications","first-page":"109","article-title":"Bicriterion path problems","volume":"vol. 177","author":"Hansen","year":"1980"},{"key":"10.1016\/S0166-218X(97)00008-5_BIB11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0377-2217(86)90092-5","article-title":"The shortest path problem with two objective functions","volume":"25","author":"Henig","year":"1985","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(97)00008-5_BIB12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0166-218X(84)90100-8","article-title":"An algorithm to determine a path with minimal cost\/capacity ratio","volume":"8","author":"Martins","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00008-5_BIB13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(84)90011-0","article-title":"On a special class of bicriterion path problems","volume":"17","author":"Martins","year":"1984","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(97)00008-5_BIB14","first-page":"33","article-title":"Structures alg\u00e9briques g\u00e9n\u00e9ralis\u00e9es des probl\u00e8mes de cheminement dans les graphes. Th\u00e9or\u00e8mes, algorithmes et applications","volume":"10","author":"Minoux","year":"1976","journal-title":"R.A.I.R.O. Rech. Op."},{"key":"10.1016\/S0166-218X(97)00008-5_BIB15","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/0377-2217(91)90073-5","article-title":"A linear time algorithm for the maximum capacity path problem","volume":"53","author":"Punnen","year":"1991","journal-title":"European J. Oper Res."},{"key":"10.1016\/S0166-218X(97)00008-5_BIB16","series-title":"proc. 7th ACM-SIAM Symp. Discrete Algorithms","first-page":"59","article-title":"On RAM priority queues","author":"Thorup","year":"1996"},{"key":"10.1016\/S0166-218X(97)00008-5_BIB17","first-page":"43","article-title":"Finding a path with minimum cost to time ratio in a network","volume":"3","author":"Tung","year":"1986","journal-title":"Asia-Pacific J. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000085?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000085?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T01:30:35Z","timestamp":1555983035000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97000085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0166218X97000085"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00008-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}