{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:37:56Z","timestamp":1769297876383,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":[[1999,2]]},"DOI":"10.1016\/s0377-2217(97)00414-1","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"664-672","source":"Crossref","is-referenced-by-count":38,"title":["A new upper bound for the 0-1 quadratic knapsack problem"],"prefix":"10.1016","volume":"112","author":[{"given":"Alain","family":"Billionnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Faye","sequence":"additional","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(97)00414-1_BIB1","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/0377-2217(94)00229-0","article-title":"Linear programming for the 0-1 quadratic knapsack problem","volume":"92","author":"Billionnet","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00414-1_BIB2","first-page":"226","article-title":"Best network flow bound for the quadratic knapsack problem","volume":"1403","author":"Chaillou","year":"1986","journal-title":"Lecture Notes in Mathematics"},{"issue":"4","key":"10.1016\/S0377-2217(97)00414-1_BIB3","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/mnsc.41.4.704","article-title":"A decomposition method for quadratic zero-one programming","volume":"41","author":"Chardaire","year":"1995","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00414-1_BIB4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","article-title":"Clustering and domination in perfect graphs","volume":"9","author":"Corneil","year":"1984","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00414-1_BIB5","unstructured":"De Farias Jr., I.R., Maculan, N., Michelon, P., 1993. Branch and Bound Schemes using Lagrangean Decomposition Techniques for 0-1 Quadratic Knapsack Problems, Logique et Analyse, to appear"},{"key":"10.1016\/S0377-2217(97)00414-1_BIB6","unstructured":"Faye, A., 1994. Programmation quadratique en variables bivalentes sous contraintes lin\u00e9aires. Application au placement de t\u00e2ches dans les syst\u00e8mes distribu\u00e9s et \u00e0 la partition de graphes, CNAM - Th\u00e8se de doctorat"},{"key":"10.1016\/S0377-2217(97)00414-1_BIB7","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(97)00414-1_BIB8","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","article-title":"A fast parametric maximum flow algorithm and applications","volume":"18","author":"Gallo","year":"1989","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"10.1016\/S0377-2217(97)00414-1_BIB9","first-page":"170","article-title":"Efficient methods for solving quadratic 0-1 knapsack problems","volume":"35","author":"Hammer","year":"1997","journal-title":"INFOR"},{"key":"10.1016\/S0377-2217(97)00414-1_BIB10","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00414-1_BIB11","unstructured":"Helmberg, C., Rendl, F., Weismantel, R., 1996. A semidefinite programming approach to the quadratic knapsack problem, ZIB, Preprint SC 96-10, 15 p"},{"key":"10.1016\/S0377-2217(97)00414-1_BIB12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01585164","article-title":"Min-cut clustering","volume":"62","author":"Johnson","year":"1993","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00414-1_BIB13","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1080\/02331938608843180","article-title":"A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm","volume":"17","author":"K\u00f6rner","year":"1986","journal-title":"Optimization"},{"key":"10.1016\/S0377-2217(97)00414-1_BIB14","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1287\/opre.18.3.454","article-title":"Quadratic binary programming with applications to capital budgeting problems","volume":"18","author":"Laughhunn","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00414-1_BIB15","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/0377-2217(94)00286-X","article-title":"Lagrangean methods for the 0-1 quadratic knapsack problem","volume":"92","author":"Michelon","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00414-1_BIB16","unstructured":"Plateau, G., 1987. R\u00e9solution du probl\u00e8me de sac-\u00e0-dos lin\u00e9aire, personal communication"},{"key":"10.1016\/S0377-2217(97)00414-1_BIB17","unstructured":"Rader Jr., D.J., 1997a. Valid inequalities and Facets of the Quadratic 0-1 Knapsack Polytope. Rutcor Research Report 16-97, 11 p"},{"key":"10.1016\/S0377-2217(97)00414-1_BIB18","unstructured":"Rader Jr., D.J., 1997b. Lifting Results for the Quadratic 0-1 Knapsack Polytope, Rutcor Research Report 17-97, 27 p"},{"key":"10.1016\/S0377-2217(97)00414-1_BIB19","doi-asserted-by":"crossref","unstructured":"Witzzgall, C., 1975. Mathematical methods of site selection for Electronic Message System (EMS), NBS International Report","DOI":"10.6028\/NBS.IR.75-737"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797004141?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797004141?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T10:32:11Z","timestamp":1578479531000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797004141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0377221797004141"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00414-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}