{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:28:31Z","timestamp":1750177711226,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,6,24]],"date-time":"2015-06-24T00:00:00Z","timestamp":1435104000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100009473","name":"Universidad de M\u00e1laga","doi-asserted-by":"crossref","award":["Plan Propio de Investigaci\u00f3n, Univ. Malaga, Programa de Fortalecimiento de Capacidades I+D+i en universidades 2014\u20132015, Fondos FEDER"],"award-info":[{"award-number":["Plan Propio de Investigaci\u00f3n, Univ. Malaga, Programa de Fortalecimiento de Capacidades I+D+i en universidades 2014\u20132015, Fondos FEDER"]}],"id":[{"id":"10.13039\/100009473","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10898-015-0324-1","type":"journal-article","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T05:29:28Z","timestamp":1435037368000},"page":"63-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Lower bound sets for biobjective shortest path problems"],"prefix":"10.1007","volume":"64","author":[{"given":"Enrique","family":"Machuca","sequence":"first","affiliation":[]},{"given":"Lawrence","family":"Mandow","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"324_CR1","unstructured":"Andreas, A.K., Smith, J.C.: Exact algorithms for robust k-path routing problems. In: International Workshop on Global, pp. 17\u201322 Optimization (2005)"},{"issue":"1","key":"324_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"YP Aneja","year":"1979","unstructured":"Aneja, Y.P., Nair, K.P.K.: Bicriteria transportation problem. Manag. Sci. 25(1), 73\u201378 (1979)","journal-title":"Manag. Sci."},{"issue":"4","key":"324_CR3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1080\/03052158408960646","volume":"7","author":"M Balachandran","year":"1984","unstructured":"Balachandran, M., Gero, J.S.: A comparison of three methods for generating the pareto optimal set. Eng. Optim. 7(4), 319\u2013336 (1984)","journal-title":"Eng. Optim."},{"issue":"4","key":"324_CR4","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s10898-010-9526-8","volume":"48","author":"O Burdakov","year":"2010","unstructured":"Burdakov, O., Doherty, P., Holmberg, K., Olsson, P.: Optimal placement of UV-based communications relay nodes. J. Glob. Optim. 48(4), 511\u2013531 (2010)","journal-title":"J. Glob. Optim."},{"key":"324_CR5","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1093\/imaman\/dpp017","volume":"21","author":"M Caramia","year":"2010","unstructured":"Caramia, M., Giordani, S., Iovanella, A.: On the selection of k routes in multiobjective hazmat route planning. IMA J. Manag. Math. 21, 239\u2013251 (2010)","journal-title":"IMA J. Manag. Math."},{"key":"324_CR6","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0020-0190(95)00086-R","volume":"55","author":"P Dasgupta","year":"1995","unstructured":"Dasgupta, P., Chakrabarti, P.P., DeSarkar, S.C.: Utility of pathmax in partial order heuristic search. Inf. Process. Lett. 55, 317\u2013322 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"324_CR7","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/3828.3830","volume":"32","author":"R Dechter","year":"1985","unstructured":"Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of A*. J. ACM 32(3), 505\u2013536 (1985)","journal-title":"J. ACM"},{"key":"324_CR8","doi-asserted-by":"crossref","unstructured":"Delort, C., Spanjaard, O.: Using bound sets in multiobjective optimization: application to the biobjective binary knapsack problem. In: Experimental Algorithms, pp. 253\u2013265. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-13193-6_22"},{"key":"324_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10288-013-0232-5","volume":"11","author":"S Demeyer","year":"2013","unstructured":"Demeyer, S., Goedgebeur, J., Audenaert, P., Pickavet, M., Demeester, P.: Speeding up martins algorithm for multiple objective shortest path problem. 4OR 11, 323\u2013348 (2013)","journal-title":"4OR"},{"key":"324_CR10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"9","key":"324_CR11","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1016\/j.cor.2005.10.003","volume":"34","author":"M Ehrgott","year":"2007","unstructured":"Ehrgott, M., Gandibleux, X.: Bound sets for biobjective combinatorial optimization problems. Comput. Oper. Res. 34(9), 2674\u20132694 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"9\u201310","key":"324_CR12","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1016\/j.artint.2011.02.001","volume":"175","author":"A Felner","year":"2011","unstructured":"Felner, A., Zahavi, U., Holte, R., Schaeffer, J., Sturtevant, N.R., Zhang, Z.: Inconsistent heuristics in theory and practice. Artifi. Intell. 175(9\u201310), 1570\u20131603 (2011)","journal-title":"Artifi. Intell."},{"key":"324_CR13","doi-asserted-by":"crossref","unstructured":"Hansen, P.: Bicriterion path problems. In: Lecture Notes in Economics and Mathematical Systems, vol. 177, pp. 109\u2013127. Springer, Berlin (1979)","DOI":"10.1007\/978-3-642-48782-8_9"},{"issue":"2","key":"324_CR14","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P Hart","year":"1968","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"3","key":"324_CR15","doi-asserted-by":"crossref","first-page":"1489","DOI":"10.1016\/j.ejor.2010.06.035","volume":"207","author":"M Iori","year":"2010","unstructured":"Iori, M., Martello, S., Pretolani, D.: An aggregate label setting policy for the multi-objective shortest path problem. Eur. J. Oper. Res. 207(3), 1489\u20131496 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"324_CR16","doi-asserted-by":"crossref","first-page":"6435","DOI":"10.1016\/j.eswa.2011.12.022","volume":"39","author":"E Machuca","year":"2012","unstructured":"Machuca, E., Mandow, L.: Multiobjective heuristic search in road maps. Expert Syst. Appl. 39, 6435\u20136445 (2012)","journal-title":"Expert Syst. Appl."},{"key":"324_CR17","unstructured":"Machuca, E., Mandow, L., P\u00e9rez de la Cruz, J.L.: An evaluation of heuristic functions for bicriterion shortest path problems. In: Proceedings of EPIA\u201909, pp. 205\u2013216 (2009)"},{"issue":"1","key":"324_CR18","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.ejor.2011.08.030","volume":"217","author":"E Machuca","year":"2012","unstructured":"Machuca, E., Mandow, L., P\u00e9rez de la Cruz, J.L., Ruiz-Sepulveda, A.: A comparison of heuristic best-first algorithms for bicriterion shortest path problems. Eur. J. Oper. Res. 217(1), 44\u201353 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"324_CR19","unstructured":"Machuca, E., Mandow, L.: Multiobjective route planning with precalculated heuristics. In: 15th Portuguese Conference on AI, EPIA 2011, pp. 98\u2013107 (2011)"},{"key":"324_CR20","unstructured":"Machuca, E.: An analysis of some algorithms and heuristics for multiobjective graph search. Ph.D. thesis, University of Malaga (2012)"},{"key":"324_CR21","doi-asserted-by":"crossref","unstructured":"Mandow, L., P\u00e9rez de la Cruz, J.L.: A memory-efficient search strategy for multiobjective shortest path problems. In: 32nd Annual German Conference on AI, KI\u20192009, volume 5803 of Lecture Notes in Computer Science, pp. 25\u201332. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-04617-9_4"},{"key":"324_CR22","doi-asserted-by":"crossref","unstructured":"Mandow, L., P\u00e9rez de la Cruz, J.L.: Multiobjective A* search with consistent heuristics. J. ACM 57(5), 1\u201325 (2010)","DOI":"10.1145\/1754399.1754400"},{"key":"324_CR23","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"EQV Martins","year":"1984","unstructured":"Martins, E.Q.V.: On a multicriteria shortest path problem. Eur. J. Oper. Res. 16, 236\u2013245 (1984)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"324_CR24","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10479-006-0072-1","volume":"147","author":"M M\u00fcller-Hannemann","year":"2006","unstructured":"M\u00fcller-Hannemann, M., Weihe, K.: On the cardinality of the Pareto set in bicriteria shortest path problems. Ann. Oper. Res. 147(1), 269\u2013286 (2006)","journal-title":"Ann. Oper. Res."},{"key":"324_CR25","volume-title":"Heuristics","author":"J Pearl","year":"1984","unstructured":"Pearl, J.: Heuristics. Addison-Wesley, Reading (1984)"},{"key":"324_CR26","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1613\/jair.4100","volume":"48","author":"JL P\u00e9rez de la Cruz","year":"2013","unstructured":"P\u00e9rez de la Cruz, J.L., Mandow, L., Machuca, E.: A case of pathology in multiobjective heuristic search. J. Artif. Intell. Res. 48, 717\u2013732 (2013)","journal-title":"J. Artif. Intell. Res."},{"issue":"4","key":"324_CR27","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.: A comparison of solution strategies for biobjective shortest path problems. Comput. Oper. Res. 36(4), 1299\u20131331 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"324_CR28","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1287\/ijoc.1070.0260","volume":"20","author":"F Sourd","year":"2008","unstructured":"Sourd, F., Spanjaard, O.: A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem. INFORMS J. Comput. 20(3), 472\u2013484 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"324_CR29","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1145\/115234.115368","volume":"38","author":"BS Stewart","year":"1991","unstructured":"Stewart, B.S., White, C.C.: Multiobjective A*. J. ACM 38(4), 775\u2013814 (1991)","journal-title":"J. ACM"},{"key":"324_CR30","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0377-2217(92)90248-8","volume":"62","author":"CT Tung","year":"1992","unstructured":"Tung, C.T., Chew, K.L.: A multicriteria Pareto-optimal path algorithm. Eur. J. Oper. Res. 62, 203\u2013209 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"324_CR31","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1023\/A:1022429905385","volume":"25","author":"J Zhang","year":"2003","unstructured":"Zhang, J., Lin, Y.: Computation of the reverse shortest-path problem. J. Global Optim. 25(3), 243\u2013261 (2003)","journal-title":"J. Global Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0324-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-015-0324-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0324-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T11:55:34Z","timestamp":1566906934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-015-0324-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,24]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["324"],"URL":"https:\/\/doi.org\/10.1007\/s10898-015-0324-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2015,6,24]]}}}