{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T09:11:17Z","timestamp":1672650677086},"reference-count":21,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1970,1,1]],"date-time":"1970-01-01T00:00:00Z","timestamp":0},"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":["Artificial Intelligence"],"published-print":{"date-parts":[[1970,1]]},"DOI":"10.1016\/0004-3702(70)90009-3","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"227-245","source":"Crossref","is-referenced-by-count":11,"title":["Heuristically guided search and chromosome matching"],"prefix":"10.1016","volume":"1","author":[{"given":"Ugo","family":"Montanari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(70)90009-3_BIB1","unstructured":"Nilsson, N.J. Problem-Solving Methods in Artificial Intelligence. McGraw-Hill Book Co., New York (to be published)."},{"key":"10.1016\/0004-3702(70)90009-3_BIB2","first-page":"235","article-title":"Experiments with the graph traverser program","volume":"294","author":"Doran","year":"1966"},{"issue":"2","key":"10.1016\/0004-3702(70)90009-3_BIB3","first-page":"100","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. SCC"},{"key":"10.1016\/0004-3702(70)90009-3_BIB4","unstructured":"Nilsson, N. J. Searching problem-solving and game-playing trees for minimal cost solutions. IFIP '68, H125-H130."},{"key":"10.1016\/0004-3702(70)90009-3_BIB5","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","article-title":"An algorithm for the traveling salesman problem","volume":"11","author":"Little","year":"1963","journal-title":"Operations Research"},{"key":"10.1016\/0004-3702(70)90009-3_BIB6","unstructured":"Dreyfus, D. An appraisal of some shortest path algorithms. Rept.No.RM-5433, Rand Corporation, Santa Monica, California, August 67."},{"key":"10.1016\/0004-3702(70)90009-3_BIB7","doi-asserted-by":"crossref","DOI":"10.2172\/4785039","article-title":"Bi-directional and heuristic search in path problems","author":"Pohl","year":"1969"},{"key":"10.1016\/0004-3702(70)90009-3_BIB8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"key":"10.1016\/0004-3702(70)90009-3_BIB9","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"key":"10.1016\/0004-3702(70)90009-3_BIB10","doi-asserted-by":"crossref","first-page":"1437","DOI":"10.1038\/2121437a0","article-title":"A Computer programme for the analysis of human chromosomes","volume":"212","author":"Gilbert","year":"1966","journal-title":"Nature"},{"key":"10.1016\/0004-3702(70)90009-3_BIB11","first-page":"1","article-title":"Un metodo per la classificazione automatica dei cromosomi","author":"Levi","year":"1968","journal-title":"Calcolos, Suppl."},{"key":"10.1016\/0004-3702(70)90009-3_BIB12","first-page":"58","article-title":"Machines to classify chromosomes?","author":"Rutovitz","year":"1967","journal-title":"Human Radiation Cytogenetics"},{"key":"10.1016\/0004-3702(70)90009-3_BIB13","first-page":"223","article-title":"Computer-oriented analysis of human chromosomes I. Photometric estimation of DNA content","volume":"5","author":"Mendelson","year":"1966"},{"key":"10.1016\/0004-3702(70)90009-3_BIB14","first-page":"45","article-title":"Automatic Classification of Chromosomes II","volume":"4","author":"Butler","year":"1966","journal-title":"Data Acquisition and Proceesing in Biology and Medicine"},{"key":"10.1016\/0004-3702(70)90009-3_BIB15","series-title":"Decision Making Processes in Pattern Recognition","author":"Sebestyen","year":"1962"},{"key":"10.1016\/0004-3702(70)90009-3_BIB16","doi-asserted-by":"crossref","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","author":"Edmonds","year":"1965","journal-title":"Canadian J. Math."},{"key":"10.1016\/0004-3702(70)90009-3_BIB17","series-title":"Finite Graphs and Networks","author":"Busaker","year":"1965"},{"key":"10.1016\/0004-3702(70)90009-3_BIB18","first-page":"842","article-title":"Two theorems in graph theory","volume":"43","author":"Berge","year":"1957"},{"issue":"1","key":"10.1016\/0004-3702(70)90009-3_BIB19","first-page":"91","article-title":"A modification of Edmonds' maximum matching algorithm","volume":"69B","author":"Witzgall","year":"1965","journal-title":"J. Res. NBS(Math. and Math. Phys.)"},{"issue":"1,2","key":"10.1016\/0004-3702(70)90009-3_BIB20","first-page":"125","article-title":"Maximum matching and a polyhedron with 0, 1, vertices","volume":"69B","author":"Edmonds","year":"1965","journal-title":"J. Res. NBS(Math. and Math. Phys.)"},{"key":"10.1016\/0004-3702(70)90009-3_BIB21","series-title":"The Art of Computer Programming","author":"Knuth","year":"1969"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370270900093?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370270900093?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T23:23:12Z","timestamp":1553642592000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370270900093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1970,1]]},"references-count":21,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1970,1]]}},"alternative-id":["0004370270900093"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(70)90009-3","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1970,1]]}}}