{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:54:18Z","timestamp":1649026458977},"reference-count":5,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"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 Processing Letters"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1016\/0020-0190(95)00051-d","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:04:31Z","timestamp":1027634671000},"page":"317-322","source":"Crossref","is-referenced-by-count":1,"title":["On the performance guarantee of neural networks for NP-hard optimization problems"],"prefix":"10.1016","volume":"54","author":[{"given":"V.","family":"Zissimopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00051-D_BIB1","series-title":"Simulated Annealing and Boltzmann Machines. A stochastic Approach to Combinational Optimization and Neural Computing","author":"Aarts","year":"1989"},{"key":"10.1016\/0020-0190(95)00051-D_BIB2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0885-064X(90)90001-T","article-title":"On the power of neural networks for solving hard problems","volume":"6","author":"Bruck","year":"1990","journal-title":"J. Complexity"},{"key":"10.1016\/0020-0190(95)00051-D_BIB3","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1981"},{"key":"10.1016\/0020-0190(95)00051-D_BIB4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(92)90248-T","article-title":"A (\u03942)-approximation algorithm, for the maximum independent set problem","volume":"44","author":"Paschos","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00051-D_BIB5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(92)90261-S","article-title":"Finding approximate solutions to NP-hard problems by neural networks is hard","volume":"41","author":"Yao","year":"1992","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500051D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500051D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T22:59:06Z","timestamp":1555282746000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909500051D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["002001909500051D"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00051-d","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}