{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T11:01:27Z","timestamp":1693134087399},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3124,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1016\/j.jcss.2004.07.002","type":"journal-article","created":{"date-parts":[[2004,8,31]],"date-time":"2004-08-31T13:27:23Z","timestamp":1093958843000},"page":"107-117","source":"Crossref","is-referenced-by-count":12,"title":["A provable better Branch and Bound method for a nonconvex integer quadratic programming problem"],"prefix":"10.1016","volume":"70","author":[{"given":"Wenxing","family":"Zhu","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jcss.2004.07.002_bib1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF02283698","article-title":"A note on adapting methods for continuous global optimization to the discrete case","volume":"25","author":"Benson","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.jcss.2004.07.002_bib2","series-title":"Computer Optimization Techniques","author":"Conley","year":"1980"},{"key":"10.1016\/j.jcss.2004.07.002_bib3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0898-1221(91)90164-Y","article-title":"An algorithm for indefinite integer quadratic programming","volume":"21","author":"Erenguc","year":"1991","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/j.jcss.2004.07.002_bib4","series-title":"Computers and Intractability\u2014A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.jcss.2004.07.002_bib5","series-title":"Recent Advances in Mathematical Programming","first-page":"159","article-title":"Integer quadratic programming","author":"Kunzi","year":"1963"},{"key":"10.1016\/j.jcss.2004.07.002_bib6","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/j.jcss.2004.07.002_bib7","doi-asserted-by":"crossref","unstructured":"P.M. Pardalos, F. Rendl, H. Wolkowicz, The quadratic assignment problem: A survey and recent developments, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, 1994, pp. 1\u201342.","DOI":"10.1090\/dimacs\/016\/01"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000400090X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000400090X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T10:58:26Z","timestamp":1549277906000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002200000400090X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["S002200000400090X"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2004.07.002","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}