乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T18:44:36Z","timestamp":1735584276979},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1016\/j.ejor.2019.01.007","type":"journal-article","created":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T01:43:55Z","timestamp":1546998235000},"page":"106-118","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":63,"title":["A biobjective Dijkstra algorithm"],"prefix":"10.1016","volume":"276","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-0681-4585","authenticated-orcid":false,"given":"Antonio","family":"Sede\u00f1o-noda","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-3074-1697","authenticated-orcid":false,"given":"Marcos","family":"Colebrook","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2019.01.007_bib0001","series-title":"Network flows: theory, algorithms and applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/j.ejor.2019.01.007_bib0002","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.cor.2016.06.022","article-title":"Analysis of FPTASes for the multi-objective shortest path problem","volume":"78","author":"Breugem","year":"2017","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2019.01.007_bib0003","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1016\/S0305-0548(02)00112-0","article-title":"Solving bicriteria 0-1 knapsack problems using a labeling algorithm","volume":"30","author":"Captivo","year":"2003","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2019.01.007_bib0005","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms. (3rd ed.). Cambridge, MA: The MIT Press."},{"issue":"4","key":"10.1016\/j.ejor.2019.01.007_bib0006","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10288-013-0232-5","article-title":"Speeding up Martins\u2019 algorithm for multiple objective shortest path problems","volume":"11","author":"Demeyer","year":"2013","journal-title":"4OR - A Quarterly Journal of Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.007_bib0007","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"key":"10.1016\/j.ejor.2019.01.007_bib0008","series-title":"9th DIMACS implementation challenge - shortest path","author":"DIMACS","year":"2013"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.007_bib0009","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1016\/j.ejor.2014.11.003","article-title":"An exact method for the biobjective shortest path problem for large-scale road networks","volume":"242","author":"Duque","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.007_bib0010","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.ejor.2019.01.007_bib0011","series-title":"Proceedings of the 6th international symposium on combinatorial search (SOCS 2013)","first-page":"80","article-title":"Bidirectional preference-based search for state graph problems","author":"Galand","year":"2013"},{"key":"10.1016\/j.ejor.2019.01.007_bib0012","series-title":"Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms","first-page":"156","article-title":"Computing the shortest path: A* search meets graph theory","volume":"1","author":"Goldberg","year":"2005"},{"key":"10.1016\/j.ejor.2019.01.007_bib0013","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1023\/A:1012602011914","article-title":"Label correcting methods to solve multicriteria shortest path problems","volume":"111","author":"Guerriero","year":"2001","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/j.ejor.2019.01.007_bib0014","series-title":"Proceedings of the 3rd international conference on multiple criteria decision making, theory and application, Hagen\/K\u00f6nigswinter 1979","first-page":"109","article-title":"Bicriterion path problems","volume":"177","author":"Hansen","year":"1980"},{"key":"10.1016\/j.ejor.2019.01.007_bib0015","doi-asserted-by":"crossref","first-page":"6435","DOI":"10.1016\/j.eswa.2011.12.022","article-title":"Multiobjective heuristic search in road maps","volume":"39","author":"Machuca","year":"2012","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ejor.2019.01.007_bib0016","first-page":"255","article-title":"On the determination of the nondominated paths in multiobjective network problem","volume":"40","author":"Martins","year":"1981","journal-title":"Methods in Operations Research"},{"key":"10.1016\/j.ejor.2019.01.007_bib0017","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","article-title":"On a multicriteria shortest path problem","volume":"16","author":"Martins","year":"1984","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.007_bib0018","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0377-2217(91)90094-C","article-title":"A parametric approach to solving bicriterion shortest path problems","volume":"53","author":"Mote","year":"1991","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.007_bib0019","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1093\/comjnl\/9.3.275","article-title":"Finding the shortest route between two points in a network","volume":"9","author":"Nicholson","year":"1966","journal-title":"The Computer Journal"},{"key":"10.1016\/j.ejor.2019.01.007_bib0020","series-title":"Computational intelligence and decision making","first-page":"489","article-title":"Labeling methods for the general case of the multi-objective shortest path problem \u2013 A computational study","author":"Paix\u00e3o","year":"2013"},{"key":"10.1016\/j.ejor.2019.01.007_bib0021","first-page":"124","article-title":"Bi-directional Search","volume":"6","author":"Pohl","year":"1971"},{"key":"10.1016\/j.ejor.2019.01.007_bib0022","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1016\/j.cor.2008.02.002","article-title":"A comparison of solution strategies for biobjective shortest path problems","volume":"36","author":"Raith","year":"2009","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2019.01.007_bib0023","series-title":"Proceedings of the 45th annual conference of the ORSNZ","first-page":"313","article-title":"Speed-up of labeling algorithms for biobjective shortest path problems","author":"Raith","year":"2010"},{"key":"10.1016\/j.ejor.2019.01.007_bib0024","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.cor.2014.11.010","article-title":"A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem","volume":"57","author":"Sede\u00f1o-Noda","year":"2015","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2019.01.007_bib0025","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/S0305-0548(99)00037-4","article-title":"A label correcting approach for solving bicriterion shortest-path problems","volume":"27","author":"Skriver","year":"2000","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2019.01.007_bib0026","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1145\/115234.115368","article-title":"Multiobjective A*","volume":"38","author":"Stewart","year":"1991","journal-title":"Journal of the ACM"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300098?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300098?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T03:20:25Z","timestamp":1550805625000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221719300098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["S0377221719300098"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2019.01.007","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2019,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A biobjective Dijkstra algorithm","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2019.01.007","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}