{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:44:43Z","timestamp":1778298283565,"version":"3.51.4"},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10790,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1984,1]]},"DOI":"10.1016\/0166-218x(84)90111-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"23-44","source":"Crossref","is-referenced-by-count":64,"title":["The indefinite zero-one quadratic problem"],"prefix":"10.1016","volume":"7","author":[{"given":"Michael W.","family":"Carter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0166-218X(84)90111-2_BIB1","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1287\/mnsc.16.1.14","article-title":"Duality in discrete programming: II. The quadratic case","volume":"16","author":"Balas","year":"1969","journal-title":"Management Science Theory Series"},{"key":"10.1016\/0166-218X(84)90111-2_BIB2","first-page":"340","article-title":"A method for quadratic programming","volume":"24","author":"Barankin","year":"1956","journal-title":"Econometrica"},{"issue":"1","key":"10.1016\/0166-218X(84)90111-2_BIB3","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.14.1.52","article-title":"Scheduling to minimize interaction cost","volume":"14","author":"Carlson","year":"1966","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(84)90111-2_BIB4","series-title":"Ph.D. thesis","article-title":"Integer quadratic programming: A continuous approach","author":"Carter","year":"1979"},{"key":"10.1016\/0166-218X(84)90111-2_BIB5","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0120892","article-title":"Quadratic knapsack problems","volume":"12","author":"Gallo","year":"1980","journal-title":"Math. Programming Study"},{"key":"10.1016\/0166-218X(84)90111-2_BIB6","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF01585529","article-title":"Newton-type methods for unconstrained and linearly constrained optimization","volume":"7","author":"Gill","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(84)90111-2_BIB7","article-title":"Numerically stable methods for quadratic programming","author":"Gill","year":"1977","journal-title":"National Physical Laboratories NAC Report No. 78, England"},{"issue":"1","key":"10.1016\/0166-218X(84)90111-2_BIB8","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/opre.21.1.156","article-title":"Further reduction of zero-one polynomial programming problems to zero\u2014one linear programming problems","volume":"21","author":"Glover","year":"1973","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/0166-218X(84)90111-2_BIB9","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","article-title":"Converting the 0\u20131 polynomial programming problem to a 0\u20131 linear program","volume":"22","author":"Glover","year":"1974","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(84)90111-2_BIB10","series-title":"Quadratic 0\u20131 programming","author":"Hammer","year":"1972"},{"issue":"3","key":"10.1016\/0166-218X(84)90111-2_BIB11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1051\/ro\/197004V300671","article-title":"Some remarks on quadratic programming with 0\u20131 variables","volume":"4","author":"Hammer","year":"1970","journal-title":"Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle Ser. Verte"},{"key":"10.1016\/0166-218X(84)90111-2_BIB12","series-title":"Numerical Methods in Non-Linear Optimization","first-page":"265","article-title":"Quadratic 0\u20131 programming by implicit enumeration","author":"Hansen","year":"1972"},{"key":"10.1016\/0166-218X(84)90111-2_BIB13","series-title":"The Theory of Matrices in Numerical Analysis","author":"Householder","year":"1963"},{"key":"10.1016\/0166-218X(84)90111-2_BIB14","series-title":"Recent Advances in Mathematical Programming","first-page":"303","article-title":"Integer quadratic programming","author":"Kunzi","year":"1963"},{"key":"10.1016\/0166-218X(84)90111-2_BIB15","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1287\/opre.18.3.454","article-title":"Quadratic binary programming with application to capital budgeting problems","volume":"18","author":"Laughhunn","year":"1970","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/0166-218X(84)90111-2_BIB16","first-page":"B51","article-title":"An extension of Lawler and Bell's method of discrete optimization with examples from capital budgeting","volume":"15","author":"Mao","year":"1968","journal-title":"Management Science Application Series"},{"issue":"3","key":"10.1016\/0166-218X(84)90111-2_BIB17","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/mnsc.26.3.282","article-title":"An implicit enumeration algorithm for quadratic integer programming","volume":"26","author":"McBride","year":"1980","journal-title":"Management Science"},{"key":"10.1016\/0166-218X(84)90111-2_BIB18","series-title":"Ph.D. thesis","author":"Picard","year":"1971"},{"key":"10.1016\/0166-218X(84)90111-2_BIB19","first-page":"291","article-title":"The assignment of computational tasks among processors in a distributed system","author":"Price","year":"1981","journal-title":"Proc. AFIPS National Computer Conf."},{"key":"10.1016\/0166-218X(84)90111-2_BIB20","series-title":"Ph.D. thesis","article-title":"Quadratic 0\u20131 programming, Boolean functions and graphs","author":"Simeone","year":"1979"},{"issue":"4","key":"10.1016\/0166-218X(84)90111-2_BIB21","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1109\/TPAS.1970.292601","article-title":"Techniques for real-time monitoring of power systems operations","volume":"89","author":"Stagg","year":"1970","journal-title":"IEEE Trans. Power App. Syst."},{"key":"10.1016\/0166-218X(84)90111-2_BIB22","first-page":"B328","article-title":"A balasian-based algorithm for zero\u2014one polynomial programming","volume":"18","author":"Taha","year":"1972","journal-title":"Management Science Application Series"},{"key":"10.1016\/0166-218X(84)90111-2_BIB23","series-title":"Ph.D. thesis","article-title":"Combinatorial aspects of certain control topics","author":"Vannelli","year":"1983"},{"key":"10.1016\/0166-218X(84)90111-2_BIB24","series-title":"The Algebraic Eigenvalue Problem","author":"Wilkinson","year":"1965"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X84901112?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X84901112?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:26:40Z","timestamp":1555122400000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X84901112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,1]]}},"alternative-id":["0166218X84901112"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(84)90111-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1984,1]]}}}