{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:03Z","timestamp":1725455883635},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0018402","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:31:37Z","timestamp":1132637497000},"page":"451-461","source":"Crossref","is-referenced-by-count":0,"title":["Pruning by upperbounds in heuristic search: Use of approximate algorithms"],"prefix":"10.1007","author":[{"given":"UK","family":"Sarkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PP","family":"Chakrabarti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S","family":"Ghose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SC","family":"DeSarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(89)90171-3","volume":"30","author":"PP Chakrabarti","year":"1989","unstructured":"Chakrabarti PP, Ghose S, Pandey A, and DeSarkar SC. Increasing search efficiency using multiple heuristics. Information Processing Letters, 30, pp 33\u201336, 1989.","journal-title":"Information Processing Letters"},{"key":"39_CR2","volume-title":"Computers and Intractability, A guide to the theory of NP \u2014 completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR and Johnson DS. Computers and Intractability, A guide to the theory of NP \u2014 completeness. W. H. Freeman and Co., New York, 1979."},{"issue":"3","key":"39_CR3","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1287\/opre.28.3.694","volume":"28","author":"B Golden","year":"1980","unstructured":"Golden B, Bodlin L, Doyle T, and Stewart W Jr. Approximate traveling salesman algorithms. Operations Research, Vol 28, No. 3, pp 694\u2013711, May \u2014 June 1980.","journal-title":"Operations Research"},{"key":"39_CR4","unstructured":"Horowitz E and Sahni S. Fundamental of computer algorithms. Galgotia, 1984."},{"key":"39_CR5","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0020-0190(87)90217-1","volume":"25","author":"M Kunde","year":"1987","unstructured":"Kunde M and Steppat H. On the worst case ratio of a compound multiprocessor scheduling algorithm. Information Processing Letters, 25, pp 389\u2013396, 1987.","journal-title":"Information Processing Letters"},{"key":"39_CR6","volume-title":"Principles of Artificial Intelligence","author":"NJ Nilsson","year":"1980","unstructured":"Nilsson NJ. Principles of Artificial Intelligence. Tioga, Palo Alto, CA, 1980."},{"key":"39_CR7","unstructured":"Pearl J. HEURISTICS Intelligent Search Strategies for Computer Problem Solving. Addison Wesley, 1984."},{"issue":"3","key":"39_CR8","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkrantz","year":"1977","unstructured":"Rosenkrantz DJ, Stearns RE, and Lewis PM. An analysis of several heuristics for the traveling salesman problem. SIAM Journal of Computing, Vol 6, No. 3, pp 563\u2013581, September 1977.","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Knowledge Based Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0018402.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:41:27Z","timestamp":1607550087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528504"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0018402","relation":{},"subject":[]}}