{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:44:08Z","timestamp":1774946648622,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":8264,"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":[[1990,12]]},"DOI":"10.1016\/0166-218x(90)90142-y","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"171-185","source":"Crossref","is-referenced-by-count":56,"title":["The basic algorithm for pseudo-Boolean programming revisited"],"prefix":"10.1016","volume":"29","author":[{"given":"Yves","family":"Crama","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Hansen","sequence":"additional","affiliation":[]},{"given":"Brigitte","family":"Jaumard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90142-Y_BIB1","first-page":"2","volume":"25","author":"Arnborg","year":"1985","journal-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposability, A survey"},{"key":"10.1016\/0166-218X(90)90142-Y_BIB2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(90)90142-Y_BIB3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","article-title":"Linear time algorithms for NP-hard problems restricted to partial k-trees","volume":"23","author":"Arnborg","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(90)90142-Y_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591796","article-title":"Nonlinear 0\u20131 programming: I. Linearization techniques","volume":"30","author":"Balas","year":"1984","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(90)90142-Y_BIB5","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/BF02591797","article-title":"Nonlinear 0\u20131 programming: II. Dominance relations and algorithms","volume":"30","author":"Balas","year":"1984","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(90)90142-Y_BIB6","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(90)90142-Y_BIB7","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0166-218X(90)90142-Y_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0885-064X(88)90006-4","article-title":"Probabilistic satisfiability","volume":"4","author":"Georgakopoulos","year":"1988","journal-title":"J. Complexity"},{"key":"10.1016\/0166-218X(90)90142-Y_BIB9","doi-asserted-by":"crossref","first-page":"1442","DOI":"10.1287\/opre.28.6.1442","article-title":"Generalized covering relaxation for 0\u20131 programs","volume":"28","author":"Granot","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90142-Y_BIB10","first-page":"359","article-title":"On the determination of the minima of pseudo-Boolean functions","volume":"14","author":"Hammer","year":"1963","journal-title":"Stud. Cerc. Mat."},{"key":"10.1016\/0166-218X(90)90142-Y_BIB11","first-page":"459","article-title":"Application of discrete linear programming to the minimization of Boolean functions","volume":"8","author":"Hammer","year":"1963","journal-title":"Rev. Math. Pures Appl."},{"key":"10.1016\/0166-218X(90)90142-Y_BIB12","series-title":"Boolean Methods in Operations Research and Related Areas","author":"Hammer","year":"1968"},{"key":"10.1016\/0166-218X(90)90142-Y_BIB13","series-title":"Th\u00e9se d'aggr\u00e9gation","article-title":"Programmes math\u00e9matiques en variables 0\u20131","author":"Hansen","year":"1974"},{"key":"10.1016\/0166-218X(90)90142-Y_BIB14","series-title":"Combinatorial Programming","first-page":"19","article-title":"Les proc\u00e9dures d'optimisation et d'exploitation par s\u00e9paration et \u00e9valuation","author":"Hansen","year":"1975"},{"key":"10.1016\/0166-218X(90)90142-Y_BIB15","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0166-218X(86)90031-4","article-title":"Unimodular functions","volume":"14","author":"Hansen","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(90)90142-Y_BIB16","article-title":"The Art of Computer Programming","volume":"Vol. 3","author":"Knuth","year":"1975"},{"key":"10.1016\/0166-218X(90)90142-Y_BIB17","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1287\/opre.14.6.1098","article-title":"A method for solving discrete optimization problems","volume":"14","author":"Lawler","year":"1966","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(90)90142-Y_BIB18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1287\/mnsc.15.2.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 Sci."},{"key":"10.1016\/0166-218X(90)90142-Y_BIB19","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors: II. Algorithmic aspect of tree-width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(90)90142-Y_BIB20","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1287\/mnsc.18.6.B328","article-title":"A Balasian-based algorithm for zero-one polynomial programming","volume":"18B","author":"Taha","year":"1972","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(90)90142-Y_BIB21","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/mnsc.19.2.226","article-title":"Further improvements in the polynomial zero-one algorithm","volume":"19","author":"Taha","year":"1972","journal-title":"Management Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090142Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090142Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:57:51Z","timestamp":1555135071000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090142Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":21,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["0166218X9090142Y"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90142-y","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}