{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T20:34:25Z","timestamp":1778877265056,"version":"3.51.4"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0167-6377(92)90043-3","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"119-123","source":"Crossref","is-referenced-by-count":71,"title":["Complexity of uniqueness and local search in quadratic 0\u20131 programming"],"prefix":"10.1016","volume":"11","author":[{"given":"Panos M","family":"Pardalos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Somesh","family":"Jha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90043-3_BIB1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01587085","article-title":"Recognition problems for special classes of polynomials in 0\u20131 variables","volume":"44","author":"Crama","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90043-3_BIB2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0167-5060(08)70343-1","article-title":"Methods of nonlinear 0\u20131 programming","volume":"5","author":"Hansen","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0167-6377(92)90043-3_BIB3","series-title":"Boolean Methods in Operations Research and Related Areas","author":"Hammer","year":"1968"},{"issue":"1","key":"10.1016\/0167-6377(92)90043-3_BIB4","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\/0167-6377(92)90043-3_BIB5","series-title":"Proceedings of the 23rd Annual Symposium on Foundations of Computer Science","first-page":"14","article-title":"On the complexity of unique solutions","author":"Papadimitriou","year":"1982"},{"issue":"1","key":"10.1016\/0167-6377(92)90043-3_BIB6","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/103147.103156","article-title":"Construction of test problems in quadratic bivalent programming","volume":"17","author":"Pardalos","year":"1991","journal-title":"ACM Trans. Math. Software"},{"issue":"6\/7","key":"10.1016\/0167-6377(92)90043-3_BIB7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0898-1221(91)90165-Z","article-title":"Graph separation techniques for quadratic zero-one programming","volume":"21","author":"Pardalos","year":"1991","journal-title":"Computers Math. Appl."},{"key":"10.1016\/0167-6377(92)90043-3_BIB8","series-title":"Impacts of Recent Computer Advances on Operations Research","first-page":"131","article-title":"Parallel branch and bound algorithms for unconstrained quadratic 0\u20131 programming","author":"Pardalos","year":"1989"},{"key":"10.1016\/0167-6377(92)90043-3_BIB9","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02023057","article-title":"Parallel branch and bound algorithms for quadratic zero-one on a hypercube architecture","volume":"22","author":"Pardalos","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/0167-6377(92)90043-3_BIB10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","article-title":"Computational aspects of a branch and bound algorithm for quadratic 0\u20131 programming","volume":"45","author":"Pardalos","year":"1990","journal-title":"Computing"},{"issue":"1","key":"10.1016\/0167-6377(92)90043-3_BIB11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0167-6377(88)90049-1","article-title":"Checking local optimality in constrained quadratic programming is NP-hard","volume":"7","author":"Pardalos","year":"1988","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(92)90043-3_BIB12","series-title":"Working Paper","article-title":"Simple local search problems that are hard to solve","author":"Sch\u00e4ffer","year":"1990"},{"key":"10.1016\/0167-6377(92)90043-3_BIB13","series-title":"Proceedings of the 17th ACM Symposium on Theory of Computing","first-page":"458","article-title":"NP is as easy as detecting unique solutions","author":"Valiant","year":"1985"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792900433?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792900433?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:27:54Z","timestamp":1552886874000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637792900433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["0167637792900433"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90043-3","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}