{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T14:09:04Z","timestamp":1782482944445,"version":"3.54.5"},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":[[2000,6]]},"DOI":"10.1016\/s0377-2217(99)00261-1","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"333-345","source":"Crossref","is-referenced-by-count":130,"title":["Approximation algorithms for knapsack problems with cardinality constraints"],"prefix":"10.1016","volume":"123","author":[{"given":"Alberto","family":"Caprara","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hans","family":"Kellerer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Pisinger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00261-1_BIB1","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"Journal of Computer System and Science"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/S0097539792228228","article-title":"Fixed-parameter tractability and completeness I: Basic results","volume":"24","author":"Downey","year":"1995","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","article-title":"Fixed-parameter tractability and completeness II: On completeness for W[1]","volume":"141","author":"Downey","year":"1995","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0166-218X(90)90021-4","article-title":"A new linear storage polynomial-time approximation scheme for the subset-sum problem","volume":"26","author":"Fischetti","year":"1990","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB5","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/0377-2217(84)90053-5","article-title":"Approximation algorithms for the m-dimensional 0\u20131 knapsack problem: Worstase and probabilistic analyses","volume":"15","author":"Frieze","year":"1984","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB6","doi-asserted-by":"crossref","unstructured":"G.V. Gens, E.V. Levner, Fast approximation algorithms for knapsack type problems, in: K. Iracki, K. Malinowski, S. Walukiewicz (Eds.), Optimization Techniques, Part 2 Lecture Notes in Control and Information Sciences, vol. 23, Springer, Berlin, 1980, pp. 185\u2013194","DOI":"10.1007\/BFb0006603"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB7","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":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1009813105532","article-title":"A New Fully Polynomial Approximation Scheme for the Knapsack Problem","volume":"3","author":"Kellerer","year":"1999","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB9","doi-asserted-by":"crossref","unstructured":"H. Kellerer, R. Mansini, U. Pferschy, M.G. Speranza, An efficient fully polynomial approximation scheme for the subset-sum problem, Technical Report, Faculty of Economics, University Graz, submitted, see also Proceedings of the 8th ISAAC Symposium, Springer Lecture Notes in Computer Science 1350 (1997) 394\u2013403","DOI":"10.1007\/3-540-63890-3_42"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB10","doi-asserted-by":"crossref","unstructured":"B. Korte, R. Schrader, On the existence of fast approximation schemes, in: O.L. Mangasarian, R.R. Meyer, S.M. Robinson (Eds.), Nonlinear Programming 4, Aademic Press, 1981, pp. 415\u2013437","DOI":"10.1016\/B978-0-12-468662-5.50020-3"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","article-title":"Fast approximation algorithms for knapsack problems","volume":"4","author":"Lawler","year":"1979","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB12","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(81)90175-2","article-title":"A fully polynomial approximation algorithm for the 0\u20131 knapsack problem","volume":"8","author":"Magazine","year":"1981","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB13","series-title":"Knapsack Problems","author":"Martello","year":"1990"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB14","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0167-6377(93)90041-E","article-title":"Linear time algorithms for some separable quadratic programming problems","volume":"13","author":"Megiddo","year":"1993","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB15","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB16","unstructured":"O. Oguz, M.J. Magazine, A polynomial time approximation algorithm for the multidimensional knapsack problem, Working Paper, University of Waterloo, Waterloo, Ont., 1980"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB17","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0166-218X(96)00134-5","article-title":"Simple but efficient approaches for the collapsing knapsack problem","volume":"77","author":"Pferschy","year":"1997","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB18","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(98)00127-9","article-title":"A fast algorithm for strongly correlated knapsack problems","volume":"89","author":"Pisinger","year":"1998","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB19","doi-asserted-by":"crossref","unstructured":"D. Pisinger, P. Toth, Knapsack problems, in: D.Z. Du, P. Pardalos (Eds.), Handbook of Combinatorial Optimization, Kluwer, Norwell, MA, 1998, pp. 1\u201389","DOI":"10.1007\/978-1-4613-0303-9_5"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB20","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01609014","article-title":"The collapsing 0\u20131 knapsack problem","volume":"15","author":"Posner","year":"1978","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB21","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/321864.321873","article-title":"Approximate algorithms for the knapsack problem","volume":"22","author":"Sahni","year":"1975","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(99)00261-1_BIB22","unstructured":"F. Vanderbeck, Computational study of a column generation algorithm for bin packing and cutting stock problems, TR-14\/96, University of Cambridge, 1996"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002611?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002611?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T03:24:51Z","timestamp":1556162691000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799002611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0377221799002611"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00261-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}