{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T19:58:22Z","timestamp":1773777502076,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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,1]]},"DOI":"10.1016\/0020-0190(94)00184-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:04:31Z","timestamp":1027634671000},"page":"69-75","source":"Crossref","is-referenced-by-count":18,"title":["A note on the complexity of local search problems"],"prefix":"10.1016","volume":"53","author":[{"given":"S.T.","family":"Fischer","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00184-Z_bib1","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Gary","year":"1979"},{"key":"10.1016\/0020-0190(94)00184-Z_bib2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","article-title":"How easy is local search?","volume":"37","author":"Johnson","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(94)00184-Z_bib3","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1137\/0219052","article-title":"On finding and verifying locally optimal solutions","volume":"19","author":"Krentel","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00184-Z_bib4","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1137\/0221030","article-title":"The complexity of the Lin-Kernighan algorithm","author":"Papadimitriou","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00184-Z_bib5","series-title":"Proc. 22nd Ann. ACM Symp. on Theory of Computing","first-page":"438","article-title":"On the complexity of local search","author":"Papadimitriou","year":"1990"},{"key":"10.1016\/0020-0190(94)00184-Z_bib6","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/0220004","article-title":"Simple local search problems that are hard to solve","volume":"20","author":"Sch\u00e4ffer","year":"1991","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400184Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400184Z?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:58:02Z","timestamp":1555282682000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909400184Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["002001909400184Z"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00184-z","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}