{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T19:36:56Z","timestamp":1766086616814},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10898-010-9566-0","type":"journal-article","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T11:54:41Z","timestamp":1277898881000},"page":"397-413","source":"Crossref","is-referenced-by-count":24,"title":["Knapsack problem with probability constraints"],"prefix":"10.1007","volume":"49","author":[{"given":"Alexei A.","family":"Gaivoronski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdel","family":"Lisser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Lopez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,7,1]]},"reference":[{"key":"9566_CR1","unstructured":"Cohn, A.M., Barnhart, C.: The stochastic knapsack problem with random weights: a heuristic approach to robust transportation planning. In: Proceedings from TRISTAN III. San Juan, Puerto Rico (1998)"},{"key":"9566_CR2","first-page":"279","volume":"40","author":"G. D\u2019Atri","year":"1980","unstructured":"D\u2019Atri G., Di Rende A.: Probabilistic analysis of knapsack-type problems. Methods Oper. Res. 40, 279\u2013282 (1980)","journal-title":"Methods Oper. Res."},{"key":"9566_CR3","doi-asserted-by":"crossref","unstructured":"Dean, B.C., Goemans, M.X., Vondrak, J.: Approximating the stochastic knapsack problem: the benefit of adaptivity. In: FOCS \u201904: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 208\u2013217. IEEE Computer Society, Washington, DC, USA (2004)","DOI":"10.1109\/FOCS.2004.15"},{"key":"9566_CR4","doi-asserted-by":"crossref","unstructured":"Fortet, R.: L\u2019alg\u00e8bre de Boole et ses applications en recherche op\u00e9rationelle (1959)","DOI":"10.1007\/BF03006558"},{"key":"9566_CR5","volume-title":"Computer and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computer and Intractability. W. H. Freeman and Company, New York (1979)"},{"key":"9566_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M., Lov\u00e1sz L., Schrijver A.: Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer, New York (1988)"},{"issue":"6","key":"9566_CR7","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans M.X., Williamson D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"9566_CR8","first-page":"291","volume":"82","author":"C. Helmberg","year":"1998","unstructured":"Helmberg C., Rendl F.: Solving quadratic (0,1)- problems by semidefinite programs and cutting planes. Math. Program. 82, 291\u2013315 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"9566_CR9","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C. Helmberg","year":"2000","unstructured":"Helmberg C., Rendl F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10(3), 673\u2013696 (2000)","journal-title":"SIAM J. Optim."},{"key":"9566_CR10","doi-asserted-by":"crossref","unstructured":"Helmberg, C., Poljak, S., Rendl, F., Wolkowicz, H.: Combining semidefinite and polyhedral relaxations for integer programs. In IPCO, pp. 124\u2013134 (1995)","DOI":"10.1007\/3-540-59408-6_46"},{"issue":"2","key":"9566_CR11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1009898604624","volume":"4","author":"C. Helmberg","year":"2000","unstructured":"Helmberg C., Rendl F., Weismantel R.: A semidefinite programming approach to the quadratic knapsack problem. J Comb. Optim. 4(2), 197\u2013215 (2000)","journal-title":"J Comb. Optim."},{"issue":"4","key":"9566_CR12","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O.H. Ibarra","year":"1975","unstructured":"Ibarra O.H., Kim C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22(4), 463\u2013468 (1975)","journal-title":"J. ACM"},{"issue":"1","key":"9566_CR13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/opre.46.1.17","volume":"46","author":"A.J. Kleywegt","year":"1998","unstructured":"Kleywegt A.J., Papastavrou J.D.: The dynamic and stochastic knapsack problem. Oper. Res. 46(1), 17\u201335 (1998)","journal-title":"Oper. Res."},{"issue":"3","key":"9566_CR14","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M. Laurent","year":"2003","unstructured":"Laurent M.: A comparison of the sherali-adams, lov\u00e1sz-schrijver, and lasserre relaxations for 0-1 programming. Math. Oper. Res. 28(3), 470\u2013496 (2003)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9566_CR15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M. Padberg","year":"1989","unstructured":"Padberg M.: The boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45(1), 139\u2013172 (1989)","journal-title":"Math. Program."},{"issue":"5","key":"9566_CR16","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","volume":"155","author":"D. Pisinger","year":"2007","unstructured":"Pisinger D.: The quadratic knapsack problem-a survey. Discrete Appl. Math. 155(5), 623\u2013648 (2007)","journal-title":"Discrete Appl. Math."},{"key":"9566_CR17","unstructured":"Rendl, F., Sotirov, R.: Bounds for the quadratic assignment problem using the bundle method. Technical report, University of Klagenfurt, Universitaetsstrasse 65\u201367, Austria (2003)"},{"issue":"3","key":"9566_CR18","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H.D. Sherali","year":"1990","unstructured":"Sherali H.D., Adams W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"9566_CR19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"H.D. Sherali","year":"1994","unstructured":"Sherali H.D., Adams W.P.: A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl. Math. 52(1), 83\u2013106 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"9566_CR20","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1145\/1217856.1217860","volume":"53","author":"D.B. Shmoys","year":"2006","unstructured":"Shmoys D.B., Swamy C.: An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM 53(6), 978\u20131012 (2006)","journal-title":"J. ACM"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9566-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-010-9566-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9566-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:58:56Z","timestamp":1559278736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-010-9566-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,1]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9566"],"URL":"https:\/\/doi.org\/10.1007\/s10898-010-9566-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,1]]}}}