{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:37:53Z","timestamp":1769297873201,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0167-6377(02)00122-0","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T19:55:37Z","timestamp":1034625337000},"page":"159-166","source":"Crossref","is-referenced-by-count":41,"title":["The quadratic 0\u20131 knapsack problem with series\u2013parallel support"],"prefix":"10.1016","volume":"30","author":[{"given":"David J.","family":"Rader Jr.","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00122-0_BIB1","unstructured":"A. Billionnet, Maximizing a quadratic tree-structured pseudo-boolean function with a cardinality constraint, Manuscript."},{"key":"10.1016\/S0167-6377(02)00122-0_BIB2","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":"Eur. J. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00122-0_BIB3","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":"Eur. J. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00122-0_BIB4","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 J. Comput."},{"key":"10.1016\/S0167-6377(02)00122-0_BIB5","unstructured":"P. Chaillou, P. Hansen, Y. Mahieu, Best Network Flow Bounds for the Quadratic Knapsack Problem, Lecture Notes in Mathematics, Vol. 1403, Springer, New York, 1986, pp. 226\u2013235."},{"key":"10.1016\/S0167-6377(02)00122-0_BIB6","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","article-title":"Topology of series-parallel networks","volume":"10","author":"Duffin","year":"1965","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0167-6377(02)00122-0_BIB7","first-page":"132","article-title":"Quadratic knapsack problems","volume":"12","author":"Gallo","year":"1980","journal-title":"Math. Prog."},{"key":"10.1016\/S0167-6377(02)00122-0_BIB8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01589108","article-title":"On the supermodular knapsack problem","volume":"45","author":"Gallo","year":"1988","journal-title":"Math. Prog."},{"key":"10.1016\/S0167-6377(02)00122-0_BIB9","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0167-6377(02)00122-0_BIB10","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\/S0167-6377(02)00122-0_BIB11","doi-asserted-by":"crossref","unstructured":"C. Helmberg, F. Rendl, R. Weismantel, Quadratic knapsack relaxations using cutting planes and semidefinite programming, Lecture Notes in Computer Science, Vol. 1084, Springer, Berlin, 1996, pp. 175\u2013189.","DOI":"10.1007\/3-540-61310-2_14"},{"key":"10.1016\/S0167-6377(02)00122-0_BIB12","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the knapsack and sum of subset problems","volume":"22","author":"Ibarra","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/S0167-6377(02)00122-0_BIB13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01585164","article-title":"Min-cut clustering","volume":"62","author":"Johnson","year":"1993","journal-title":"Math. Prog."},{"key":"10.1016\/S0167-6377(02)00122-0_BIB14","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","article-title":"Fast approximation schemes for knapsack problems","volume":"4","author":"Lawler","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00122-0_BIB15","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 J. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00122-0_BIB16","unstructured":"D.J. Rader, Valid inequalities and facets of the quadratic 0\u20131 knapsack polytope, RUTCOR Research Report 16-97, RUTCOR, Rutgers University, 1997."},{"key":"10.1016\/S0167-6377(02)00122-0_BIB17","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/322326.322328","article-title":"Linear-time computability of combinatorial problems on series-parallel graphs","volume":"29","author":"Takamizawa","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S0167-6377(02)00122-0_BIB18","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series-parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(02)00122-0_BIB19","doi-asserted-by":"crossref","unstructured":"C. Witzgall, Mathematical methods of site selection for electronic message systems (EMS), NBS Internal Report, 1975.","DOI":"10.6028\/NBS.IR.75-737"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001220?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001220?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:22:28Z","timestamp":1555057348000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0167637702001220"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00122-0","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}