{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:20:08Z","timestamp":1774596008832,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,2,23]],"date-time":"2013-02-23T00:00:00Z","timestamp":1361577600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10288-013-0232-5","type":"journal-article","created":{"date-parts":[[2013,2,22]],"date-time":"2013-02-22T09:02:25Z","timestamp":1361523745000},"page":"323-348","source":"Crossref","is-referenced-by-count":26,"title":["Speeding up Martins\u2019 algorithm for multiple objective shortest path problems"],"prefix":"10.1007","volume":"11","author":[{"given":"Sofie","family":"Demeyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Goedgebeur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pieter","family":"Audenaert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Pickavet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piet","family":"Demeester","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,23]]},"reference":[{"key":"232_CR1","unstructured":"9th DIMACS implementation challenge (2006) Shortest paths. http:\/\/www.dis.uniroma1.it\/~challenge9"},{"key":"232_CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0377-2217(93)90095-5","volume":"69","author":"JA Azevedo","year":"1993","unstructured":"Azevedo JA, Costa MEOS, Madeira JJERS, Martins EQV (1993) An algorithm for the ranking of shortest paths. Eur J Oper Res 69:97\u2013106","journal-title":"Eur J Oper Res"},{"key":"232_CR3","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":"232_CR4","doi-asserted-by":"crossref","first-page":"1969","DOI":"10.1016\/j.cor.2011.09.006","volume":"39","author":"C Bornstein","year":"2012","unstructured":"Bornstein C, Maculan N, Pascoal MMB, Pinto L (2012) Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization. Comput Oper Res 39:1969\u20131976","journal-title":"Comput Oper Res"},{"key":"232_CR5","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0377-2217(89)90215-4","volume":"43","author":"J Brumbaugh-Smith","year":"1989","unstructured":"Brumbaugh-Smith J, Shier D (1989) An empirical investigation of some bicriterion shortest path algorithms. Eur J Oper Res 43:216\u2013224","journal-title":"Eur J Oper Res"},{"key":"232_CR6","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/0377-2217(82)90205-3","volume":"11","author":"JNC Cl\u00edmaco","year":"1982","unstructured":"Cl\u00edmaco JNC, Martins EQV (1982) A bicriterion shortest path algorithm. Eur J Oper Res 11:399\u2013404","journal-title":"Eur J Oper Res"},{"key":"232_CR7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1111\/j.1475-3995.2011.00815.x","volume":"19","author":"JNC Cl\u00edmaco","year":"2012","unstructured":"Cl\u00edmaco JNC, Pascoal MMB (2012) Multicriteria path and tree problems\u2014discussion on exact algorithms and applications. Int Trans Oper Res 19:63\u201398","journal-title":"Int Trans Oper Res"},{"key":"232_CR8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.ejor.2008.09.036","volume":"198","author":"L Lima Pinto de","year":"2009","unstructured":"de Lima Pinto L, Bornstein CT, Maculan N (2009) The tricriterion shortest path problem with at least two bottleneck objective functions. Eur J Oper Res 198:387\u2013391","journal-title":"Eur J Oper Res"},{"key":"232_CR9","unstructured":"Demeyer S, Audenaert P, Slock B, Pickavet M, Demeester P (2008) Multimodal transport planning in a dynamic environment. Conference on intelligent public transport systems, Amsterdam, pp 155\u2013167"},{"key":"232_CR10","doi-asserted-by":"crossref","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. Numerische Mathematik 1:269\u2013271","journal-title":"Numerische Mathematik"},{"key":"232_CR11","unstructured":"Disser Y, M\u00fcller-Hannemann M, Schnee M (2008) Multi-criteria shortest paths in time-dependent train networks, experimental algorithms, 7th international workshop, WEA 2008. Provincetown, MA, USA pp 347\u2013361"},{"key":"232_CR12","doi-asserted-by":"crossref","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":"232_CR13","doi-asserted-by":"crossref","unstructured":"Ehrgott M, Gandibleux X (2002) Multiple criteria optimization: state of the art annotated bibliographic surveys, international series in operations research and management science, vol. 52, Springer","DOI":"10.1007\/b101915"},{"key":"232_CR14","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein D (1998) Finding the k shortest paths. SIAM J Comput 28:652\u2013673","journal-title":"SIAM J Comput"},{"key":"232_CR15","doi-asserted-by":"crossref","first-page":"3324","DOI":"10.1016\/j.cor.2005.03.027","volume":"33","author":"L Fu","year":"2006","unstructured":"Fu L, Sun D, Rilett LR (2006) Heuristic shortest path algorithms for transportation applications: state of the art. Comput Oper Res 33:3324\u20133343","journal-title":"Comput Oper Res"},{"key":"232_CR16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10288-005-0074-x","volume":"4","author":"X Gandibleux","year":"2006","unstructured":"Gandibleux X, Beugnies F, Randriamasy S (2006) Martins\u2019 algorithm revisited for multi-objective shortest path problems with MaxMin cost function. 4OR Q J Oper Res 4:47\u201359","journal-title":"4OR Q J Oper Res"},{"key":"232_CR17","doi-asserted-by":"crossref","first-page":"3081","DOI":"10.1016\/j.comnet.2010.05.017","volume":"54","author":"RG Garroppo","year":"2010","unstructured":"Garroppo RG, Giordano S, Tavanti L (2010) A survey on multi-constrained optimal path computation: exact and approximate algorithms. Comput Netw 54:3081\u20133107","journal-title":"Comput Netw"},{"key":"232_CR18","doi-asserted-by":"crossref","unstructured":"Geisberger R, Sanders P, Schultes D, Delling D (2008) Contraction Hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch (ed) Workshop on experimental algorithms, LNCS 5038. Springer-Verlag, Berlin\/Heidelberg, pp 319\u2013333","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"232_CR19","doi-asserted-by":"crossref","unstructured":"Goldberg A, Kaplan H, Werneck R (2006) Reach for A*: efficient point-to-point shortest path algorithms. In: Workshop on algorithm engineering and experiments, Miami, pp 129\u2013143","DOI":"10.1137\/1.9781611972863.13"},{"key":"232_CR20","doi-asserted-by":"crossref","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"},{"key":"232_CR21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-642-48782-8_9","volume-title":"Multiple criteria decision making: theory and applications, lecture notes in economics and in mathematical systems 177","author":"P Hansen","year":"1980","unstructured":"Hansen P (1980) Bicriterion path problems. In: Fandel G, Gal T (eds) Multiple criteria decision making: theory and applications, lecture notes in economics and in mathematical systems 177. Springer, Heidelberg, pp 109\u2013127"},{"key":"232_CR22","doi-asserted-by":"crossref","unstructured":"Jim\u00e9nez V, Marzal A (1999) Computing the K shortest paths: a new algorithm and experimental comparison. In: Vitter JS, Zaroliagis CD (eds) Proceedings of the 3rd international workshop on algorithm engineering, LNCS 1668. Springer-Verlag Berlin\/Heidelberg, pp 15\u201329","DOI":"10.1007\/3-540-48318-7_4"},{"key":"232_CR23","doi-asserted-by":"crossref","unstructured":"Jim\u00e9nez V, Marzal A (2003) A lazy version of Eppstein\u2019s k shortest path algorithm. In: Jansen K, Margraf M, Matrolli M, Rolim J (eds) Proceedings of the 2nd international workshop on experimental and efficient algorithms, LNCS 2647. Springer-Verlag Berlin\/Heidelberg, pp 179\u2013191","DOI":"10.1007\/3-540-44867-5_14"},{"key":"232_CR24","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"EQV Martins","year":"1984","unstructured":"Martins EQV (1984a) On a multicriteria shortest path problem. Eur J Oper Res 16:236\u2013245","journal-title":"Eur J Oper Res"},{"key":"232_CR25","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0377-2217(84)90269-8","volume":"18","author":"EQV Martins","year":"1984","unstructured":"Martins EQV (1984b) An algorithm for ranking paths that may contain cycles. Eur J Oper Res 18:123\u2013130","journal-title":"Eur J Oper Res"},{"key":"232_CR26","unstructured":"Martins EQV, Paix\u00e3o JM, Rosa MS, Santos JLE (2007) Ranking multiobjective shortest paths, Pr\u00e9-publica\u00e7\u00f5es do Departamento de Matem\u00e1tica 07\u201311, Universidade de Coimbra"},{"key":"232_CR27","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1142\/S0129054199000186","volume":"10","author":"EQV Martins","year":"1999","unstructured":"Martins EQV, Pascoal MMB, Santos JLE (1999) Deviation algorithms for ranking shortest paths. Int J Found Comput Sci 10:247\u2013263","journal-title":"Int J Found Comput Sci"},{"key":"232_CR28","unstructured":"Martins EQV, Pascoal MMB, Santos JLE (2000) Labeling algorithms for ranking shortest paths. Technical Report 001 CISUC"},{"key":"232_CR29","first-page":"47","volume":"21","author":"EQV Martins","year":"2001","unstructured":"Martins EQV, Pascoal MMB, Santos JLE (2001) A new improvement for a K shortest path algorithm. Investiga\u00e7\u00e3o Oper 21:47\u201360","journal-title":"Investiga\u00e7\u00e3o Oper"},{"key":"232_CR30","unstructured":"Martins EQV, Santos JLE (1999) The labeling algorithm for the multiobjective shortest path problem, CISUC technical report TR 99\/005, University of Coimbra, Portugal"},{"key":"232_CR31","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1093\/comjnl\/9.3.275","volume":"9","author":"JAT Nicholson","year":"1966","unstructured":"Nicholson JAT (1966) Finding the shortest route between two points in a network. Comput J 9:275\u2013280","journal-title":"Comput J"},{"key":"232_CR32","first-page":"205","volume":"4","author":"JMA Pangilinan","year":"2007","unstructured":"Pangilinan JMA, Janssens GK (2007) Evolutionary algorithms for the multiobjective shortest path problem. Int J Appl Sci Eng Technol 4:205\u2013210","journal-title":"Int J Appl Sci Eng Technol"},{"key":"232_CR33","unstructured":"Paix\u00e3o JM, Santos JL (2007) Labelling methods for the general case of the multi-objective shortest path problem\u2014a computational study, Pr\u00e9-publica\u00e7\u00f5es do Departamento de Matem\u00e1tica 07-42, Universidade de Coimbra"},{"key":"232_CR34","unstructured":"Paix\u00e3o JM, Santos JL (2008) A new ranking path algorithm for the multiobjective shortest path problem, Pr\u00e9-publica\u00e7\u00f5es do Departamento de Matem\u00e1tica 08-27, Universidade de Coimbra"},{"key":"232_CR35","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1016\/j.cor.2010.01.005","volume":"37","author":"L Pinto","year":"2010","unstructured":"Pinto L, Pascoal MMB (2010) On algorithms for tricriteria shortest path problems with two bottleneck objective functions. Comput Oper Res 37:1774\u20131779","journal-title":"Comput Oper Res"},{"key":"232_CR36","unstructured":"Raith A (2010) Speed-up of labelling algorithms for biobjective shortest path problems. In: Proceedings of the 45th annual conference of the ORSNZ. Auckland, New Zealand, pp 313\u2013322"},{"key":"232_CR37","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1016\/j.cor.2008.02.002","volume":"36","author":"A Raith","year":"2009","unstructured":"Raith A, Ehrgott M (2009) A comparison of solution strategies for biobjective shortest path problems. Comput Oper Res 36:1299\u20131331","journal-title":"Comput Oper Res"},{"key":"232_CR38","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BF03398701","volume":"40","author":"V Sastry","year":"2003","unstructured":"Sastry V, Janakiraman T, Mohideen S (2003) New algorithms for multi-objective shortest path problem. Opsearch 40:278\u2013298","journal-title":"Opsearch"},{"key":"232_CR39","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/978-3-642-46618-2_15","volume":"294","author":"P Serafini","year":"1986","unstructured":"Serafini P (1986) Some considerations about computational complexity for multiobjective combinatorial problems. Recent advances and historical development of vector optimization 294:222\u2013232","journal-title":"Recent advances and historical development of vector optimization"},{"key":"232_CR40","first-page":"192","volume":"17","author":"AJV Skriver","year":"2000","unstructured":"Skriver AJV (2000) A classification of bicriterion shortest path (BSP) algorithms. Asia Pac J Oper Res 17:192\u2013212","journal-title":"Asia Pac J Oper Res"},{"key":"232_CR41","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/S0305-0548(99)00037-4","volume":"27","author":"AJV Skriver","year":"2000","unstructured":"Skriver AJV, Andersen K (2000) A label correcting approach for solving bicriterion shortest-path problems. Comput Oper Res 27:507\u2013524","journal-title":"Comput Oper Res"},{"key":"232_CR42","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1145\/115234.115368","volume":"38","author":"BS Stewart","year":"1991","unstructured":"Stewart BS, White CC (1991) Multiobjective A*. J Assoc Comput Mach 38:775\u2013814","journal-title":"J Assoc Comput Mach"},{"key":"232_CR43","first-page":"425","volume":"16","author":"P Vincke","year":"1974","unstructured":"Vincke P (1974) Problemes multicrit\u00e8res. Cahiers Centre Etudes Recherche Operationnelle 16:425\u2013439","journal-title":"Cahiers Centre Etudes Recherche Operationnelle"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-013-0232-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-013-0232-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-013-0232-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T18:33:03Z","timestamp":1595442783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-013-0232-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,23]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["232"],"URL":"https:\/\/doi.org\/10.1007\/s10288-013-0232-5","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,23]]}}}