{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T22:57:46Z","timestamp":1648508266120},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0020-0255(92)90009-w","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T13:28:37Z","timestamp":1056979717000},"page":"145-175","source":"Crossref","is-referenced-by-count":3,"title":["Generalized best first search using single and multiple heuristics"],"prefix":"10.1016","volume":"60","author":[{"given":"P.P.","family":"Chakrabarti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Ghose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.C.","family":"De Sarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0255(92)90009-W_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2455.2458","article-title":"Three approaches to heuristic search in networks","volume":"32","author":"Bagchi","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0020-0255(92)90009-W_BIB2","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0004-3702(86)90074-3","article-title":"Heuristic search through islands","volume":"29","author":"Chakrabarti","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0020-0255(92)90009-W_BIB3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(87)90005-1","article-title":"Admissibility of ao\u2217 when heuristics overestimate","volume":"34","author":"Chakrabarti","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0020-0255(92)90009-W_BIB4","series-title":"Proc. of the 16th ACM Computer Science Conference","first-page":"256","article-title":"Best first search in and\/or graphs","author":"Chakrabarti","year":"1988"},{"key":"10.1016\/0020-0255(92)90009-W_BIB5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(89)90171-3","article-title":"Increasing search efficiency using multiple heuristics","volume":"30","author":"Chakrabarti","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0255(92)90009-W_BIB6","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1987"},{"issue":"2","key":"10.1016\/0020-0255(92)90009-W_BIB7","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/322003.322010","article-title":"The power of dominance relations in branch and bound algorithms","volume":"24","author":"Ibaraki","year":"1977","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0020-0255(92)90009-W_BIB8","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/2455.2459","article-title":"and\/or graph search methods","volume":"32","author":"Mahanti","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0020-0255(92)90009-W_BIB9","series-title":"Proc. of the 3rd. Joint Conf. on AI","first-page":"1","article-title":"Additive and\/or graphs","author":"Martelli","year":"1973"},{"issue":"12","key":"10.1016\/0020-0255(92)90009-W_BIB10","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1145\/359657.359664","article-title":"Optimizing decision trees through heuristically guided search","volume":"21","author":"Martelli","year":"1978","journal-title":"C. ACM"},{"key":"10.1016\/0020-0255(92)90009-W_BIB11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0004-3702(84)90003-1","article-title":"A heuristic search algorithm with modifiable estimate","volume":"23","author":"Mero","year":"1984","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0020-0255(92)90009-W_BIB12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(84)90004-3","article-title":"General branch and bound and its relation to a\u2217 and ao\u2217","volume":"23","author":"Nau","year":"1984","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0020-0255(92)90009-W_BIB13","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/0020-0255(92)90009-W_BIB14","series-title":"Heuristics","author":"Pearl","year":"1984"},{"issue":"4","key":"10.1016\/0020-0255(92)90009-W_BIB15","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/TPAMI.1982.4767270","article-title":"Studies in semi-admissible heuristics","volume":"4","author":"Pearl","year":"1982","journal-title":"IEEE Trans. PAMI"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559290009W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559290009W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:25:05Z","timestamp":1552901105000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002002559290009W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["002002559290009W"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(92)90009-w","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}