{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:57:09Z","timestamp":1773752229836,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,10,31]],"date-time":"2007-10-31T00:00:00Z","timestamp":1193788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1007\/s10589-007-9113-1","type":"journal-article","created":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T09:20:28Z","timestamp":1193736028000},"page":"67-104","source":"Crossref","is-referenced-by-count":9,"title":["Convergent Lagrangian and domain cut method for nonlinear knapsack problems"],"prefix":"10.1007","volume":"42","author":[{"given":"D.","family":"Li","sequence":"first","affiliation":[]},{"given":"X. L.","family":"Sun","sequence":"additional","affiliation":[]},{"given":"J.","family":"Wang","sequence":"additional","affiliation":[]},{"given":"K. I. M.","family":"McKinnon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,31]]},"reference":[{"key":"9113_CR1","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.25.3.419","volume":"25","author":"D.E. Bell","year":"1977","unstructured":"Bell, D.E., Shapiro, J.F.: A convergent duality theory for integer programming. Oper. Res. 25, 419\u2013434 (1977)","journal-title":"Oper. Res."},{"key":"9113_CR2","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/opre.43.4.670","volume":"43","author":"K.M. Bretthauer","year":"1995","unstructured":"Bretthauer, K.M., Shetty, B.: The nonlinear resource allocation problem. Oper. Res. 43, 670\u2013683 (1995)","journal-title":"Oper. Res."},{"key":"9113_CR3","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/S0305-0548(00)00089-7","volume":"29","author":"K.M. Bretthauer","year":"2002","unstructured":"Bretthauer, K.M., Shetty, B.: A pegging algorithm for the nonlinear resource allocation problem. Comput. Oper. Res. 29, 505\u2013527 (2002)","journal-title":"Comput. Oper. Res."},{"key":"9113_CR4","volume-title":"Sampling Techniques","author":"W.G. Cochran","year":"1963","unstructured":"Cochran, W.G.: Sampling Techniques. Wiley, New York (1963)"},{"key":"9113_CR5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/nav.3800270108","volume":"27","author":"M.W. Cooper","year":"1980","unstructured":"Cooper, M.W.: The use of dynamic programming for the solution of a class of nonlinear programming problems. Nav. Res. Logist. Q. 27, 89\u201395 (1980)","journal-title":"Nav. Res. Logist. Q."},{"key":"9113_CR6","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/mnsc.27.3.353","volume":"27","author":"M.W. Cooper","year":"1981","unstructured":"Cooper, M.W.: Survey of methods of pure nonlinear integer programming. Manag. Sci. 27, 353\u2013361 (1981)","journal-title":"Manag. Sci."},{"key":"9113_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0167-6377(88)90041-7","volume":"7","author":"M. Djerdjour","year":"1988","unstructured":"Djerdjour, M., Mathur, K., Salkin, H.M.: A surrogate relaxation based on algorithm for a general class quadratic multi-dimensional knapsack problem. Oper. Res. Lett. 7, 253\u2013258 (1988)","journal-title":"Oper. Res. Lett."},{"key":"9113_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01585097","volume":"24","author":"M.E. Dyer","year":"1982","unstructured":"Dyer, M.E., Walker, J.: Solving the subproblem in the Lagrangian dual of separable discrete programs with linear constraints. Math. Program. 24, 107\u2013112 (1982)","journal-title":"Math. Program."},{"key":"9113_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L.: The Lagrangian relaxation method for solving integer programming problems. Manag. Sci. 27, 1\u201318 (1981)","journal-title":"Manag. Sci."},{"key":"9113_CR10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0127003","volume":"27","author":"M.L. Fisher","year":"1974","unstructured":"Fisher, M.L., Shapiro, J.F.: Constructive duality in integer programming. SIAM J. Appl. Math. 27, 31\u201352 (1974)","journal-title":"SIAM J. Appl. Math."},{"key":"9113_CR11","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A.M. Geoffrion","year":"1974","unstructured":"Geoffrion, A.M.: Lagrangean relaxation for integer programming. Math. Program. Study 2, 82\u2013114 (1974)","journal-title":"Math. Program. Study"},{"key":"9113_CR12","volume-title":"Large-Scale Optimization with Applications, Part II: Optimization Design and Control","author":"I.E. Grossmann","year":"1997","unstructured":"Grossmann, I.E., Kravanja, Z.: Mixed-integer nonlinear programming: a survey of algorithms and applications. In: Conn, A.R., Coleman, T.F., Biegler, L.T., Santosa, F.N. (eds.) Large-Scale Optimization with Applications, Part II: Optimization Design and Control. Springer, New York (1997)"},{"key":"9113_CR13","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"O.K. Gupta","year":"1985","unstructured":"Gupta, O.K., Ravindran, A.: Branch and bound experiments in convex nonlinear integer programming. Manag. Sci. 31, 1533\u20131546 (1985)","journal-title":"Manag. Sci."},{"key":"9113_CR14","volume-title":"Convex Analysis and Minimization Algorithms, vols. 1 and 2","author":"J.B. Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms, vols. 1 and 2. Springer, Berlin (1993)"},{"key":"9113_CR15","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0167-6377(95)00009-9","volume":"17","author":"D.S. Hochbaum","year":"1995","unstructured":"Hochbaum, D.S.: A nonlinear knapsack problem. Oper. Res. Lett. 17, 103\u2013110 (1995)","journal-title":"Oper. Res. Lett."},{"key":"9113_CR16","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1145\/96559.96597","volume":"37","author":"D.S. Hochbaum","year":"1990","unstructured":"Hochbaum, D.S., Shanthikumar, J.G.: Convex separable optimization is not much harder than linear optimization. J. Assoc. Comput. Mach. 37, 843\u2013862 (1990)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9113_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02947-3","volume-title":"Global Optimization: Deterministic Approaches","author":"R. Horst","year":"1993","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Heidelberg (1993)"},{"key":"9113_CR18","volume-title":"Resource Allocation Problems: Algorithmic Approaches","author":"T. Ibaraki","year":"1988","unstructured":"Ibaraki, T., Katoh, N.: Resource Allocation Problems: Algorithmic Approaches. MIT Press, Cambridge (1988)"},{"key":"9113_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0074500","volume-title":"Methods of Descent for Nondifferentiable Optimization","author":"K.C. Kiwiel","year":"1985","unstructured":"Kiwiel, K.C.: Methods of Descent for Nondifferentiable Optimization. Springer, Berlin (1985)"},{"key":"9113_CR20","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1287\/opre.46.2.272","volume":"46","author":"M.S. Kodialam","year":"1998","unstructured":"Kodialam, M.S., Luss, H.: Algorithm for separable nonlinear resource allocation problems. Oper. Res. 46, 272\u2013284 (1998)","journal-title":"Oper. Res."},{"key":"9113_CR21","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/0377-2217(89)90109-4","volume":"38","author":"F. Korner","year":"1989","unstructured":"Korner, F.: A hybrid method for solving nonlinear knapsack problems. Eur. J. Oper. Res. 38, 238\u2013241 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"9113_CR22","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/PL00011429","volume":"90","author":"C. Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal, C., Renaud, A.: A geometric study of duality gaps, with applications. Math. Program. 90, 399\u2013427 (2001)","journal-title":"Math. Program."},{"key":"9113_CR23","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1008325116400","volume":"18","author":"D. Li","year":"2000","unstructured":"Li, D., Sun, X.L.: Success guarantee of dual search in nonlinear integer programming: P-th power Lagrangian method. J. Glob. Optim. 18, 235\u2013254 (2000)","journal-title":"J. Glob. Optim."},{"key":"9113_CR24","volume-title":"Nonlinear Integer Programming","author":"D. Li","year":"2006","unstructured":"Li, D., Sun, X.L.: Nonlinear Integer Programming. Springer, New York (2006)"},{"key":"9113_CR25","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1019252306512","volume":"98","author":"D. Li","year":"2000","unstructured":"Li, D., White, D.J.: P-th power Lagrangian method for integer programming. Ann. Oper. Res. 98, 151\u2013170 (2000)","journal-title":"Ann. Oper. Res."},{"key":"9113_CR26","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01588949","volume":"14","author":"R.E. Marsten","year":"1978","unstructured":"Marsten, R.E., Morin, T.L.: A hybrid approach to discrete mathematical programming. Math. Program. 14, 21\u201340 (1978)","journal-title":"Math. Program."},{"key":"9113_CR27","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)"},{"key":"9113_CR28","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0167-6377(86)90107-0","volume":"5","author":"K. Mathur","year":"1986","unstructured":"Mathur, K., Salkin, H.M., Mohanty, B.B.: A note on a general non-linear knapsack problems. Oper. Res. Lett. 5, 79\u201381 (1986)","journal-title":"Oper. Res. Lett."},{"key":"9113_CR29","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0167-6377(83)90047-0","volume":"2","author":"K. Mathur","year":"1983","unstructured":"Mathur, K., Salkin, H.M., Morito, S.: A branch and search algorithm for a class of nonlinear knapsack problems. Oper. Res. Lett. 2, 55\u201360 (1983)","journal-title":"Oper. Res. Lett."},{"key":"9113_CR30","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/S0036144598330177","volume":"42","author":"A. Melman","year":"1991","unstructured":"Melman, A., Rabinowitz, G.: An efficient method for a class of continuous nonlinear knapsack problems. SIAM Rev. 42, 440\u2013448 (1991)","journal-title":"SIAM Rev."},{"key":"9113_CR31","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01582893","volume":"52","author":"P. Michelon","year":"1991","unstructured":"Michelon, P., Maculan, N.: Lagrangian decomposition for integer nonlinear programming with linear constraints. Math. Program. 52, 303\u2013313 (1991)","journal-title":"Math. Program."},{"key":"9113_CR32","unstructured":"Minoux, M., Tuy, H.: Discrete monotonic global optimization. Technical report. http:\/\/www.mat.univie.ac.at\/~neum\/glopt\/mss\/MinT02.pdf (2002)"},{"key":"9113_CR33","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s101079900112","volume":"87","author":"P. Neame","year":"2000","unstructured":"Neame, P., Boland, N., Ralph, D.: An outer approximation subdifferential method for piecewise affine optimization. Math. Program. 87, 57\u201386 (2000)","journal-title":"Math. Program."},{"key":"9113_CR34","volume-title":"Discrete Optimization","author":"R.G. Parker","year":"1988","unstructured":"Parker, R.G., Rardin, R.L.: Discrete Optimization. Academic Press, Boston (1988)"},{"key":"9113_CR35","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0167-5060(08)70346-7","volume":"5","author":"J.F. Shapiro","year":"1979","unstructured":"Shapiro, J.F.: A survey of Lagrangian techniques for discrete optimization. Ann. Discrete Math. 5, 113\u2013138 (1979)","journal-title":"Ann. Discrete Math."},{"key":"9113_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"H.D. Sherali","year":"1999","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic, Dordrecht (1999)"},{"key":"9113_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization Methods for Non-Differentiable Functions","author":"N.Z. Shor","year":"1985","unstructured":"Shor, N.Z.: Minimization Methods for Non-Differentiable Functions. Springer, Berlin (1985)"},{"key":"9113_CR38","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1287\/moor.25.4.625.12114","volume":"25","author":"X.L. Sun","year":"2000","unstructured":"Sun, X.L., Li, D.: Asymptotic strong duality for bounded integer programming: a logarithmic-exponential dual formulation. Math. Oper. Res. 25, 625\u2013644 (2000)","journal-title":"Math. Oper. Res."},{"key":"9113_CR39","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/A:1016541912439","volume":"3","author":"X.L. Sun","year":"2002","unstructured":"Sun, X.L., Li, D.: Optimality condition and branch and bound algorithm for constrained redundancy optimization in series systems. Optim. Eng. 3, 53\u201365 (2002)","journal-title":"Optim. Eng."},{"key":"9113_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3532-1","volume-title":"Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications","author":"M. Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Kluwer Academic, Dordrecht (2002)"},{"key":"9113_CR41","volume-title":"Optimization of System Reliability","author":"F.A. Tillman","year":"1980","unstructured":"Tillman, F.A., Hwuang, C.L., Kuo, W.: Optimization of System Reliability. Dekker, New York (1980)"},{"key":"9113_CR42","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/S1052623499359828","volume":"11","author":"H. Tuy","year":"2000","unstructured":"Tuy, H.: Monotonic optimization: problems and solution approaches. SIAM J. Optim. 11, 464\u2013494 (2000)","journal-title":"SIAM J. Optim."},{"key":"9113_CR43","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1080\/00207728008967030","volume":"11","author":"S.G. Tzafestas","year":"1980","unstructured":"Tzafestas, S.G.: Optimization of system reliability: a survey of problems and techniques. Int. J. Syst. Sci. 11, 455\u2013486 (1980)","journal-title":"Int. J. Syst. Sci."},{"key":"9113_CR44","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1080\/07408178708975391","volume":"19","author":"R.V.V. Vidal","year":"1987","unstructured":"Vidal, R.V.V.: A simple method to solve some simple allocation problems. IIE Trans. 19, 234\u2013237 (1987)","journal-title":"IIE Trans."},{"key":"9113_CR45","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1023\/A:1014839227049","volume":"113","author":"X. Zhao","year":"2002","unstructured":"Zhao, X., Luh, P.B.: New boundle methods for solving Lagrangian relaxation dual problems. J. Optim. Theory Appl. 113, 373\u2013397 (2002)","journal-title":"J. Optim. Theory Appl."},{"key":"9113_CR46","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/0167-6377(82)90030-X","volume":"1","author":"H. Ziegler","year":"1982","unstructured":"Ziegler, H.: Solving certain singly constrained convex optimization problems in production planning. Oper. Res. Lett. 1, 246\u2013252 (1982)","journal-title":"Oper. Res. Lett."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9113-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9113-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9113-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:33Z","timestamp":1559288193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9113-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,31]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["9113"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9113-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,31]]}}}