{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:25:40Z","timestamp":1740201940935,"version":"3.37.3"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"abstract":"<jats:p>This paper studies the complexity of two different algorithms proposed as extensions of A* for multiobjective search: MOA* and NAMOA*. It is known that, for any given problem, NAMOA* requires the consideration of no more alternatives than MOA* when provided with the same heuristic information.<\/jats:p>","DOI":"10.3233\/978-1-60750-606-5-727","type":"book-chapter","created":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:26:53Z","timestamp":1740133613000},"source":"Crossref","is-referenced-by-count":0,"title":["A note on the complexity of some multiobjective A* search algorithms"],"prefix":"10.3233","author":[{"family":"Mandow Lawrence","sequence":"additional","affiliation":[]},{"family":"P&eacute;rez de la Cruz Jos&eacute;-Luis","sequence":"additional","affiliation":[]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","ECAI 2010"],"original-title":[],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:27:05Z","timestamp":1740133625000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=0922-6389&volume=215&spage=727"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-60750-606-5-727","relation":{},"ISSN":["0922-6389"],"issn-type":[{"value":"0922-6389","type":"print"}],"subject":[],"published":{"date-parts":[[2010]]}}}