{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T11:29:03Z","timestamp":1776338943583,"version":"3.51.2"},"reference-count":51,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":[[2002,5]]},"DOI":"10.1016\/s0377-2217(01)00179-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:56:01Z","timestamp":1034610961000},"page":"459-472","source":"Crossref","is-referenced-by-count":196,"title":["The nonlinear knapsack problem \u2013 algorithms and applications"],"prefix":"10.1016","volume":"138","author":[{"given":"Kurt M","family":"Bretthauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bala","family":"Shetty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00179-5_BIB1","first-page":"116","article-title":"An O(Nlog(1\/\u03b5)) algorithm for the two-resource allocation problem with a non-differentiable convex objective function","volume":"46","author":"Armstrong","year":"1995","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/ijoc.10.1.114","article-title":"An efficient algorithm for a class of two-resource allocation problems","volume":"10","author":"Armstrong","year":"1998","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF02283698","article-title":"A note on adapting methods for continuous global optimization to the discrete case","volume":"25","author":"Benson","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB4","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(01)00179-5_BIB5","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1287\/mnsc.27.4.431","article-title":"Dissagregation and resource allocation using convex knapsack problems with bounded variables","volume":"27","author":"Bitran","year":"1981","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB6","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1287\/opre.37.4.547","article-title":"Tradeoff curves, targeting and balancing in manufacturing queueing networks","volume":"37","author":"Bitran","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF02096601","article-title":"Capacity planning in manufacturing networks with discrete options","volume":"17","author":"Bitran","year":"1989","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB8","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/opre.43.4.670","article-title":"The nonlinear resource allocation problem","volume":"43","author":"Bretthauer","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0167-6377(96)00039-9","article-title":"Quadratic resource allocation with generalized upper bounds","volume":"20","author":"Bretthauer","year":"1997","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB10","doi-asserted-by":"crossref","unstructured":"Bretthauer, K.M., Shetty, B., 2001. A pegging algorithm for the nonlinear resource allocation problem. Computers and Operations Research 29 (5) 505\u2013527","DOI":"10.1016\/S0305-0548(00)00089-7"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB11","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/S0377-2217(98)00180-5","article-title":"Nonlinear integer programming for optimal allocation in stratified sampling","volume":"116","author":"Bretthauer","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1287\/ijoc.7.1.109","article-title":"A branch and bound algorithm for integer quadratic knapsack problems","volume":"7","author":"Bretthauer","year":"1995","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB13","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1057\/jors.1996.44","article-title":"A projection method for the integer quadratic knapsack problem","volume":"47","author":"Bretthauer","year":"1996","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB14","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1111\/j.1540-5915.1994.tb01860.x","article-title":"A model for resource constrained production and inventory management","volume":"25","author":"Bretthauer","year":"1994","journal-title":"Decision Sciences"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0167-6377(84)90010-5","article-title":"An O(n) algorithm for quadratic knapsack problems","volume":"3","author":"Brucker","year":"1984","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB16","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(01)00179-5_BIB17","series-title":"Sampling Techniques","author":"Cochran","year":"1963"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB18","series-title":"Dynamic Programming Algorithms and Applications","author":"Denardo","year":"1982"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB19","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/BF02591992","article-title":"Convex quadratic programming with one constraint and bounded variables","volume":"36","author":"Dussault","year":"1986","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB20","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02591716","article-title":"Solution techniques for some allocation problems","volume":"25","author":"Federgruen","year":"1983","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB21","first-page":"132","article-title":"Quadratic knapsack problems","volume":"12","author":"Gallo","year":"1980","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB22","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TCOM.1977.1093709","article-title":"On the topological design of distributed computer networks","volume":"25","author":"Gerla","year":"1977","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB23","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(01)00179-5_BIB24","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/BF01588328","article-title":"A polynomially bounded algorithm for a singly constrained quadratic program","volume":"18","author":"Helgason","year":"1980","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB25","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1287\/moor.19.2.390","article-title":"Lower and upper bounds for the allocation problem and other nonlinear optimization problems","volume":"19","author":"Hochbaum","year":"1994","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB26","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0167-6377(95)00009-9","article-title":"A nonlinear knapsack problem","volume":"17","author":"Hochbaum","year":"1995","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB27","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01585561","article-title":"About strongly polynomial time algorithms for quadratic optimization over submodular constraints","volume":"69","author":"Hochbaum","year":"1995","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB28","series-title":"Global Optimization: Deterministic Approaches","author":"Horst","year":"1990"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB29","series-title":"Resource Allocation Problems","author":"Ibaraki","year":"1988"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB30","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0167-6377(90)90067-F","article-title":"On a discrete nonlinear and nonseparable knapsack problem","volume":"9","author":"Klastorin","year":"1990","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB31","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1287\/opre.46.2.272","article-title":"Algorithms for separable nonlinear resource allocation problems","volume":"46","author":"Kodialam","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB32","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(01)00179-5_BIB33","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1016\/0305-0548(93)90118-3","article-title":"Constrained multi-item inventory systems: An implicit approach","volume":"20","author":"Maloney","year":"1993","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB34","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB35","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0167-6377(86)90107-0","article-title":"A note on a general non-linear knapsack problem","volume":"5","author":"Mathur","year":"1986","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB36","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0167-6377(83)90047-0","article-title":"A branch and search algorithm for a class of nonlinear knapsack problems","volume":"2","author":"Mathur","year":"1983","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB37","unstructured":"McCallum, C.J., Undated. An algorithm for certain quadratic integer programs. Bell Laboratories Technical Report, Holmdel, NJ"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB38","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0167-5060(08)70748-9","article-title":"On some nonlinear knapsack problems","volume":"1","author":"Michaeli","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB39","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"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB40","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01588800","article-title":"On the solution of concave knapsack problems","volume":"49","author":"Mor\u00e9","year":"1991","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB41","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1287\/ijoc.4.2.166","article-title":"Massively parallel algorithms for singly constrained convex programs","volume":"4","author":"Nielsen","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB42","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/opre.41.2.319","article-title":"A massively parallel algorithm for nonlinear stochastic network problems","volume":"41","author":"Nielsen","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB43","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/opre.28.3.754","article-title":"A new and efficient algorithm for a class of portfolio selection problems","volume":"28","author":"Pang","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB44","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF01585748","article-title":"An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds","volume":"46","author":"Pardalos","year":"1990","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB45","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0024-3795(91)90267-Z","article-title":"Algorithms for the solution of quadratic knapsack problems","volume":"152","author":"Pardalos","year":"1991","journal-title":"Linear Algebra and Its Applications"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB46","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01581193","article-title":"On the continuous quadratic knapsack problem","volume":"55","author":"Robinson","year":"1992","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB47","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1057\/jors.1990.121","article-title":"A parallel projection for the multicommodity network model","volume":"41","author":"Shetty","year":"1990","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB48","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.4.1.2","article-title":"Solving large sparse nonlinear programs using GRG","volume":"4","author":"Smith","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB49","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0167-6377(88)90068-5","article-title":"A note on multi-item inventory systems with limited capacity","volume":"7","author":"Ventura","year":"1988","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB50","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/0167-6377(82)90030-X","article-title":"Solving certain singly constrained convex optimization problems in production planning","volume":"1","author":"Ziegler","year":"1982","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00179-5_BIB51","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1287\/mnsc.26.1.34","article-title":"Simple ranking methods for allocation of one resource","volume":"26","author":"Zipkin","year":"1980","journal-title":"Management Science"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701001795?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701001795?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T00:21:31Z","timestamp":1556929291000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701001795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0377221701001795"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00179-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}