{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:22:43Z","timestamp":1759666963360},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":7747,"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":[[1992,5]]},"DOI":"10.1016\/0166-218x(92)90256-a","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"233-251","source":"Crossref","is-referenced-by-count":14,"title":["A solvable class of quadratic 0\u20131 programming"],"prefix":"10.1016","volume":"36","author":[{"given":"Srimat T.","family":"Chakradhar","sequence":"first","affiliation":[]},{"given":"Michael L.","family":"Bushnell","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90256-A_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0166-218X(92)90256-A_BIB2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(86)90065-X","article-title":"A solvable case of quadratic 0\u20131 programming","volume":"13","author":"Barahona","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)90256-A_BIB3","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0012-365X(79)90160-2","article-title":"Polytope des independants d'un graphe serie-parallele","volume":"27","author":"Boulala","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)90256-A_BIB4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(84)90111-2","article-title":"The indefinite zero one quadratic problem","volume":"7","author":"Carter","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)90256-A_BIB5","series-title":"PhD thesis","article-title":"Neural network models and optimization methods for digital testing","author":"Chakradhar","year":"1990"},{"key":"10.1016\/0166-218X(92)90256-A_BIB6","first-page":"416","article-title":"Automatic test pattern generation using neural networks","author":"Chakradhar","year":"1988","journal-title":"IEEE Proceedings of the International Conference on Computer-Aided Design"},{"key":"10.1016\/0166-218X(92)90256-A_BIB7","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1109\/43.59074","article-title":"Toward massively parallel automatic test generation","volume":"9","author":"Chakradhar","year":"1990","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"10.1016\/0166-218X(92)90256-A_BIB8","series-title":"Tech. Rep. RRR #54-88","article-title":"The basic algorithm for pseudo-Boolean programming revisited","author":"Crama","year":"1988"},{"key":"10.1016\/0166-218X(92)90256-A_BIB9","series-title":"Logic Testing and Design for Testability","author":"Fujiwara","year":"1985"},{"key":"10.1016\/0166-218X(92)90256-A_BIB10","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(92)90256-A_BIB11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02612354","article-title":"Roof duality, complementation and persistence in quadratic 0\u20131 optimization","volume":"28","author":"Hammer","year":"1984","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(92)90256-A_BIB12","series-title":"Boolean Methods in Operations Research","author":"Hammer","year":"1968"},{"key":"10.1016\/0166-218X(92)90256-A_BIB13","series-title":"Tech. Rep. RRR #20-87","article-title":"Quadratic functions of binary variables","author":"Hammer","year":"1987"},{"issue":"5","key":"10.1016\/0166-218X(92)90256-A_BIB14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/101.8118","article-title":"Artificial neural networks","volume":"4","author":"Hopfield","year":"1988","journal-title":"IEEE Circuits and Devices Magazine"},{"key":"10.1016\/0166-218X(92)90256-A_BIB15","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230050405","article-title":"Minimum cuts and related problems","volume":"5","author":"Picard","year":"1975","journal-title":"Networks"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290256A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290256A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:23:09Z","timestamp":1555136589000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290256A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["0166218X9290256A"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90256-a","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}