{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:53:30Z","timestamp":1742399610405},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"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,9]]},"DOI":"10.1016\/0020-0255(92)90070-o","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T13:28:37Z","timestamp":1056979717000},"page":"207-227","source":"Crossref","is-referenced-by-count":30,"title":["Criticizing solutions to relaxed models yields powerful admissible heuristics"],"prefix":"10.1016","volume":"63","author":[{"given":"Othar","family":"Hansson","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Mayer","sequence":"additional","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(92)90070-O_BIB1","first-page":"235","article-title":"Experiments with the graph traverser program","volume":"294","author":"Doran","year":"1966"},{"key":"10.1016\/0020-0255(92)90070-O_BIB2","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0255(92)90070-O_BIB3","series-title":"Proceedings of the International Joint Conference on Artificial Intelligence","article-title":"A problem similarity approach to devising heuristics: First results","author":"Gaschnig","year":"1979"},{"key":"10.1016\/0020-0255(92)90070-O_BIB4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0020-0255(79)90024-0","article-title":"A method for computing heuristics in problem solving","volume":"19","author":"Guida","year":"1979","journal-title":"Inform. Sci."},{"key":"10.1016\/0020-0255(92)90070-O_BIB5","article-title":"Generating Admissible Heuristics by Criticizing Solutions to Relaxed Models","author":"Hansson","year":"1985"},{"key":"10.1016\/0020-0255(92)90070-O_BIB6","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling-salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Oper. Res."},{"key":"10.1016\/0020-0255(92)90070-O_BIB7","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling-salesman problem and minimum spanning trees: Part II","volume":"1","author":"Held","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/0020-0255(92)90070-O_BIB8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative deepening: An optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artif. Intell."},{"key":"10.1016\/0020-0255(92)90070-O_BIB9","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","year":"1985"},{"key":"10.1016\/0020-0255(92)90070-O_BIB10","series-title":"Topics in Artificial Intelligence","article-title":"Toward a theory of problem solving","author":"Mandrioli","year":"1976"},{"key":"10.1016\/0020-0255(92)90070-O_BIB11","series-title":"Proceedings of the International Joint Conference on Artificial Intelligence","article-title":"Discovering admissible heuristics by abstracting and optimizing: A transformational approach","author":"Mostow","year":"1989"},{"key":"10.1016\/0020-0255(92)90070-O_BIB12","series-title":"Human Problem Solving","author":"Newell","year":"1972"},{"key":"10.1016\/0020-0255(92)90070-O_BIB13","series-title":"Heuristics: Intelligent Search Strategies for Computer Problem Soving","author":"Pearl","year":"1984"},{"key":"10.1016\/0020-0255(92)90070-O_BIB14","series-title":"How to Solve It","author":"Polya","year":"1973"},{"key":"10.1016\/0020-0255(92)90070-O_BIB15","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0020-0255(92)90070-O_BIB16","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0020-0255(84)90009-4","article-title":"A result on the computational complexity of heuristic estimates for the A\u2217 algorithm","volume":"34","author":"Valtorta","year":"1984","journal-title":"Inform. Sci."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559290070O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559290070O?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:26:08Z","timestamp":1552901168000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002002559290070O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["002002559290070O"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(92)90070-o","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}