{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T16:19:42Z","timestamp":1783613982696,"version":"3.55.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2008,6,25]],"date-time":"2008-06-25T00:00:00Z","timestamp":1214352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100011011","name":"Junta de Andaluc\u00eda","doi-asserted-by":"crossref","award":["P07-TIC-03018"],"award-info":[{"award-number":["P07-TIC-03018"]}],"id":[{"id":"10.13039\/501100011011","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2010,6]]},"abstract":"<jats:p>\n            The article describes and analyzes NAMOA\n            <jats:sup>*<\/jats:sup>\n            , an algorithm for multiobjective heuristic graph search problems. The algorithm is presented as an extension of A\n            <jats:sup>*<\/jats:sup>\n            , an admissible scalar shortest path algorithm. Under consistent heuristics A\n            <jats:sup>*<\/jats:sup>\n            is known to improve its efficiency with more informed heuristics, and to be optimal over the class of admissible algorithms in terms of the set of expanded nodes and the number of node expansions. Equivalent beneficial properties are shown to prevail in the new algorithm.\n          <\/jats:p>","DOI":"10.1145\/1754399.1754400","type":"journal-article","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T17:43:38Z","timestamp":1277487818000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":81,"title":["Multiobjective A\n            <sup>*<\/sup>\n            search with consistent heuristics"],"prefix":"10.1145","volume":"57","author":[{"given":"Lawrence","family":"Mandow","sequence":"first","affiliation":[{"name":"Universidad de M\u00e1laga, M\u00e1laga, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9. Luis P\u00e9rez","family":"De La Cruz","sequence":"additional","affiliation":[{"name":"Universidad de M\u00e1laga, M\u00e1laga, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,6,25]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011242703014"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322095"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00086-R"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Dasgupta P. Chakrabarti P. and DeSarkar S. 1999. Multiobjective Heuristic Search. Vieweg Braunschweig\/Wiesbaden.  Dasgupta P. Chakrabarti P. and DeSarkar S. 1999. Multiobjective Heuristic Search. Vieweg Braunschweig\/Wiesbaden.","DOI":"10.1007\/978-3-322-86853-4"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3830"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00188-6"},{"key":"e_1_2_1_8_1","volume-title":"LNEMS 177","author":"Hansen P."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/358172.358406"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Mahanti A. and Ray K. 1988. Network search algorithms with modifiable heuristics. In Search in Artificial Intelligence. Springer-Verlag Berlin Germany 200--222.   Mahanti A. and Ray K. 1988. Network search algorithms with modifiable heuristics. In Search in Artificial Intelligence. Springer-Verlag Berlin Germany 200--222.","DOI":"10.1007\/978-1-4613-8788-6_6"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00517-9"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the XIX International Joint Conference on Artificial Intelligence (IJCAI'05)","author":"Mandow L."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11881216_20"},{"key":"e_1_2_1_15_1","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"KI'2009: Advances in Artificial Intelligence","author":"Mandow L."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(84)90003-1"},{"key":"e_1_2_1_17_1","unstructured":"Pearl J. 1984. Heuristics. Addison-Wesley Reading MA.  Pearl J. 1984. Heuristics. Addison-Wesley Reading MA."},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 18th National Conference on Artificial Intelligence. AAAI Press, 751--756","author":"Perny P."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.12.013"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00371-5"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/115234.115368"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1754399.1754400","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1754399.1754400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:50Z","timestamp":1750245770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1754399.1754400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,25]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["10.1145\/1754399.1754400"],"URL":"https:\/\/doi.org\/10.1145\/1754399.1754400","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,25]]},"assertion":[{"value":"2006-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}