{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:57:43Z","timestamp":1766066263711,"version":"3.40.3"},"publisher-location":"Dordrecht","reference-count":21,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789400747210"},{"type":"electronic","value":"9789400747227"}],"license":[{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-94-007-4722-7_46","type":"book-chapter","created":{"date-parts":[[2012,11,7]],"date-time":"2012-11-07T20:35:59Z","timestamp":1352320559000},"page":"489-502","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Labeling Methods for the General Case of the Multi-objective Shortest Path Problem \u2013 A Computational Study"],"prefix":"10.1007","author":[{"given":"J. M.","family":"Paix\u00e3o","sequence":"first","affiliation":[]},{"given":"J. L.","family":"Santos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,8,1]]},"reference":[{"key":"46_CR1","volume-title":"Network flows \u2013 theory, algorithms, and applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja R, Magnanti TL, Orlin J (1993) Network flows \u2013 theory, algorithms, and applications. Prentice-Hall, Inc., Upper Saddle River"},{"key":"46_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman R (1958) On a routing problem. Q Appl Math 16:87\u201390","journal-title":"Q Appl Math"},{"key":"46_CR3","first-page":"129","volume":"73","author":"BV Cherkassky","year":"1993","unstructured":"Cherkassky BV, Goldberg AV, Radzik T (1993) Shortest paths algorithms: theory and experimental evaluation. Math Program 73:129\u2013174","journal-title":"Math Program"},{"issue":"2","key":"46_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/net.3230140208","volume":"14","author":"N Deo","year":"1984","unstructured":"Deo N, Pang C (1984) Shortest path algorithms: taxonomy and annotation. Networks 14(2):275\u2013323","journal-title":"Networks"},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/363269.363610","volume":"12","author":"R Dial","year":"1969","unstructured":"Dial R (1969) Algorithm 360: shortest path forest with topological ordering. Commun ACM 12:632\u2013633","journal-title":"Commun ACM"},{"key":"46_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/net.3230090304","volume":"9","author":"R Dial","year":"1979","unstructured":"Dial R et al (1979) A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Networks 9:215\u2013348","journal-title":"Networks"},{"key":"46_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269\u2013271","journal-title":"Numer Math"},{"key":"46_CR8","volume-title":"Multiple criteria optimization \u2013 classification and methodology","author":"M Ehrgott","year":"1997","unstructured":"Ehrgott M (1997) Multiple criteria optimization \u2013 classification and methodology. Shaker Verlag, Aachen"},{"key":"46_CR9","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott M, Gandibleux X (2000) A survey and annotated bibliography of multiobjective combinatorial optimization. OR-Spektrum 22:425\u2013460","journal-title":"OR-Spektrum"},{"key":"46_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/b101915","volume-title":"Multiple criteria optimization: state of the art annotated bibliographic survey","author":"M Ehrgott","year":"2002","unstructured":"Ehrgott M, Gandibleux X (2002) Multiple criteria optimization: state of the art annotated bibliographic survey. Kluwer Academic Publishers, Boston"},{"key":"46_CR11","volume-title":"Flows in networks","author":"J Ford","year":"1962","unstructured":"Ford J, Fulkerson D (1962) Flows in networks. Princeton University Press, Princeton"},{"key":"46_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02288320","volume":"13","author":"G Gallo","year":"1988","unstructured":"Gallo G, Pallotino S (1988) Shortest path methods. Ann Oper Res 13:3\u201379","journal-title":"Ann Oper Res"},{"key":"46_CR13","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1023\/A:1012602011914","volume":"111","author":"F Guerriero","year":"2001","unstructured":"Guerriero F, Musmanno R (2001) Label correcting methods to solve multicriteria shortest path problems. J Optim Theory Appl 111:589\u2013613","journal-title":"J Optim Theory Appl"},{"doi-asserted-by":"crossref","unstructured":"Hansen P (1980) Bicriterion path problems, In: Fandel G, Gal T (eds) Multiple criteria decision making: theory and application. Lectures notes in economics and mathematical systems, vol 177. Springer, Heidelberg, pp 109\u2013127","key":"46_CR14","DOI":"10.1007\/978-3-642-48782-8_9"},{"key":"46_CR15","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"E Martins","year":"1984","unstructured":"Martins E (1984) On a multicriteria shortest path problem. Eur J Oper Res 16:236\u2013245","journal-title":"Eur J Oper Res"},{"unstructured":"Moore E (1959) The shortest path through a maze. In: Proceedings of the international symposium on the theory of switching. Harvard University Press, pp 285\u2013292","key":"46_CR16"},{"key":"46_CR17","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/BF01585517","volume":"7","author":"U Pape","year":"1974","unstructured":"Pape U (1974) Implementation and efficiency of Moore-algorithms for the shortest route problem. Math Program 7:212\u2013222","journal-title":"Math Program"},{"key":"46_CR18","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1145\/355900.355919","volume":"6","author":"U Pape","year":"1980","unstructured":"Pape U (1980) Algorithm 562: shortest paths lengths. ACM Trans Math Softw 6:450\u2013455","journal-title":"ACM Trans Math Softw"},{"unstructured":"Santos J (2003) Optimiza\u00e7\u00e3o vectorial em redes. Ph.D. thesis, Departamento de Matem\u00e1tica, Universidade de Coimbra","key":"46_CR19"},{"unstructured":"Santos J, Paix\u00e3o J, Rosa M (2005) A statistical analysis on the number of non-dominated paths in the multiobjective shortest path problem. In: Proceedings international network optimization conference, Lisbon, Portugal, pp 21\u201323","key":"46_CR20"},{"key":"46_CR21","first-page":"425","volume":"16","author":"P Vincke","year":"1974","unstructured":"Vincke P (1974) Probl\u00e8mes multicrit\u00e8res. Cahiers du Centre d'\u00c9tudes de Recherche Op\u00e9rationelle 16:425\u2013439","journal-title":"Cahiers du Centre d'\u00c9tudes de Recherche Op\u00e9rationelle"}],"container-title":["Intelligent Systems, Control and Automation: Science and Engineering","Computational Intelligence and Decision Making"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-94-007-4722-7_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T04:53:56Z","timestamp":1676782436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-94-007-4722-7_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,1]]},"ISBN":["9789400747210","9789400747227"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-94-007-4722-7_46","relation":{},"ISSN":["2213-8986","2213-8994"],"issn-type":[{"type":"print","value":"2213-8986"},{"type":"electronic","value":"2213-8994"}],"subject":[],"published":{"date-parts":[[2012,8,1]]},"assertion":[{"value":"1 August 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}