{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T12:50:30Z","timestamp":1748436630949,"version":"3.37.3"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"abstract":"<jats:p>Frontier search is a new search technique that achieves important memory savings over previous best-first search algorithms. This paper describes an extension of frontier search to bicriterion graph search problems that achieves also important memory savings. The new algorithm is evaluated using a set of random problems.<\/jats:p>","DOI":"10.3233\/978-1-58603-891-5-480","type":"book-chapter","created":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:27:05Z","timestamp":1740133625000},"source":"Crossref","is-referenced-by-count":2,"title":["Frontier Search for Bicriterion Shortest Path Problems"],"prefix":"10.3233","author":[{"family":"Mandow L.","sequence":"additional","affiliation":[]},{"family":"P&eacute;rez de la Cruz J.L.","sequence":"additional","affiliation":[]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","ECAI 2008"],"original-title":[],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:46:45Z","timestamp":1740134805000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=0922-6389&volume=178&spage=480"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-58603-891-5-480","relation":{},"ISSN":["0922-6389"],"issn-type":[{"value":"0922-6389","type":"print"}],"subject":[],"published":{"date-parts":[[2008]]}}}