{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T11:29:02Z","timestamp":1776338942584,"version":"3.51.2"},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T00:00:00Z","timestamp":1093996800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,9]]},"DOI":"10.1016\/s0377-2217(03)00244-3","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T15:12:00Z","timestamp":1062601920000},"page":"565-575","source":"Crossref","is-referenced-by-count":103,"title":["An exact method based on Lagrangian decomposition for the 0\u20131 quadratic knapsack problem"],"prefix":"10.1016","volume":"157","author":[{"given":"Alain","family":"Billionnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9ric","family":"Soutif","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00244-3_BIB1","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/0377-2217(94)00229-0","article-title":"Linear programming for the 0\u20131 quadratic knapsack problem","volume":"92","author":"Billionnet","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00244-3_BIB2","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1016\/S0377-2217(97)00414-1","article-title":"A new upper bound for the 0\u20131 quadratic knapsack problem","volume":"112","author":"Billionnet","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00244-3_BIB3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/ijoc.11.2.125","article-title":"Exact solution of the quadratic knapsack problem","volume":"11","author":"Caprara","year":"1999","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(03)00244-3_BIB4","article-title":"Best Network Flow Bound for the Quadratic Knapsack Problem","volume":"Vol. 1403","author":"Chaillou","year":"1986"},{"key":"10.1016\/S0377-2217(03)00244-3_BIB5","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/mnsc.41.4.704","article-title":"A decomposition method for quadratic zero\u2013one programming","volume":"41","author":"Chardaire","year":"1995","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(03)00244-3_BIB6","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0120892","article-title":"Quadratic knapsack problems","volume":"12","author":"Gallo","year":"1980","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0377-2217(03)00244-3_BIB7","first-page":"170","article-title":"Efficient methods for solving quadratic 0\u20131 knapsack problems","volume":"35","author":"Hammer","year":"1997","journal-title":"INFOR"},{"key":"10.1016\/S0377-2217(03)00244-3_BIB8","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/0377-2217(94)00286-X","article-title":"Lagrangean methods for the 0\u20131 quadratic knapsack problem","volume":"92","author":"Michelon","year":"1996","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002443?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002443?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T12:50:37Z","timestamp":1551099037000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703002443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["S0377221703002443"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00244-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}