{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T06:40:08Z","timestamp":1742625608050,"version":"3.40.2"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10845-012-0632-y","type":"journal-article","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T06:25:43Z","timestamp":1330496743000},"page":"821-829","source":"Crossref","is-referenced-by-count":4,"title":["A comparison of multiobjective depth-first algorithms"],"prefix":"10.1007","volume":"24","author":[{"given":"J.","family":"Coego","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Mandow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. L.","family":"P\u00e9rez de la Cruz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,3,1]]},"reference":[{"key":"632_CR1","doi-asserted-by":"crossref","unstructured":"Coego, J., Mandow, L., & P\u00e9rez de la Cruz, J. L. (2009). A new approach to iterative deepening multiobjective A*. In AI*IA 2009, LNCS 5883, pp. 264\u2013273.","DOI":"10.1007\/978-3-642-10291-2_27"},{"issue":"2","key":"632_CR2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.ejor.2009.10.015","volume":"204","author":"L. Galand","year":"2010","unstructured":"Galand L., Perny P., Spanjaard O. (2010) Choquet-based optimisation in multiobjective shortest path and spanning tree problems. European Journal of Operational Research 204(2): 303\u2013315","journal-title":"European Journal of Operational Research"},{"key":"632_CR3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(96)00009-9","volume":"58","author":"S. Harikumar","year":"1996","unstructured":"Harikumar S., Kumar S. (1996) Iterative deepening multiobjective A*. Information Processing Letters 58: 11\u201315","journal-title":"Information Processing Letters"},{"issue":"5","key":"632_CR4","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1145\/1089023.1089024","volume":"52","author":"R. Korf","year":"2005","unstructured":"Korf R., Zhang W., Thayer I., Hohwald H. (2005) Frontier search. JACM 52(5): 715\u2013748","journal-title":"JACM"},{"key":"632_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. E. Korf","year":"1985","unstructured":"Korf R. E. (1985a) Depth first iterative deepening: An optimal admissible tree search. Artificial Intelligence 27: 97\u2013109","journal-title":"Artificial Intelligence"},{"key":"632_CR6","unstructured":"Korf, R. E. (1985b). Iterative-deepening A*: An optimal admissible tree search. In Proceedings of the IX international joint conference on artificial intelligence (IJCAI 1985) (pp. 1034\u20131036)."},{"key":"632_CR7","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A. Land","year":"1960","unstructured":"Land A., Doig A. (1960) An automatic method of solving discrete programming problems. Econometrica 28: 497\u2013520","journal-title":"Econometrica"},{"issue":"1","key":"632_CR8","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10845-008-0169-2","volume":"21","author":"X. Li","year":"2010","unstructured":"Li X., Yalaoui F., Amodeo L. (2010) Metaheuristics and exact methods to solve a multiobjective parallel machines scheduling problem. Journal of Intelligent Manufacturing 21(1): 89\u2013 99","journal-title":"Journal of Intelligent Manufacturing"},{"key":"632_CR9","doi-asserted-by":"crossref","unstructured":"Mandow, L., P\u00e9rez de la Cruz, J. L. (2008). Frontier search for bicriterion shortest path problems. In 18th European conference on artificial intelligence (ECAI 2008) (pp. 480\u2013484).","DOI":"10.3233\/978-1-58603-891-5-480"},{"issue":"5","key":"632_CR10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/1754399.1754400","volume":"57","author":"L. Mandow","year":"2010","unstructured":"Mandow L., P\u00e9rez de la Cruz J. L. (2010a) Multiobjective A* search with consistent heuristics. Journal of the ACM 57(5): 27\u2013125","journal-title":"Journal of the ACM"},{"key":"632_CR11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10845-008-0169-2","volume":"21","author":"L. Mandow","year":"2010","unstructured":"Mandow L., P\u00e9rez de la Cruz J. L. (2010b) Path recovery in frontier search for multiobjective shortest path problems. Journal of Intelligent Manufacturing 21: 89\u201399","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"4","key":"632_CR12","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. Computers & Operations Research 36(4): 1299\u20131331","journal-title":"Computers & Operations Research"},{"key":"632_CR13","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1109\/34.297950","volume":"16","author":"A. Reinefeld","year":"1994","unstructured":"Reinefeld A., Marsland T. (1994) Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence 16: 701\u2013710","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"632_CR14","unstructured":"Roll\u00f3n, E., Larrosa, J. (2009). Constraint optimization techniques for multiobjective branch and bound search. In Lecture notes in economics and mathematical systems, (Vol. 618, pp. 89\u201398)."},{"issue":"3","key":"632_CR15","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. (2008) A multiobjective branch-and-bound framework: Application to the bi-objective spanning tree problem. INFORMS Journal on Computing 20(3): 472\u2013484","journal-title":"INFORMS Journal on Computing"},{"key":"632_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1538-7","volume-title":"State-space search: Algorithms, complexity, extensions, and applications","author":"W. Zhang","year":"1999","unstructured":"Zhang W. (1999) State-space search: Algorithms, complexity, extensions, and applications. Springer, Berlin"},{"key":"632_CR17","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0004-3702(94)00047-6","volume":"79","author":"W. Zhang","year":"1995","unstructured":"Zhang W., Korf R. (1995) Performance of linear-space search algorithms. Artificial Intelligence 79: 241\u2013292","journal-title":"Artificial Intelligence"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-012-0632-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-012-0632-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-012-0632-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T05:41:49Z","timestamp":1742622109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-012-0632-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,1]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["632"],"URL":"https:\/\/doi.org\/10.1007\/s10845-012-0632-y","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"type":"print","value":"0956-5515"},{"type":"electronic","value":"1572-8145"}],"subject":[],"published":{"date-parts":[[2012,3,1]]}}}