{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T09:50:56Z","timestamp":1785750656096,"version":"3.56.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,7,12]],"date-time":"2015-07-12T00:00:00Z","timestamp":1436659200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2011-0027301"],"award-info":[{"award-number":["2011-0027301"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10107-015-0931-0","type":"journal-article","created":{"date-parts":[[2015,7,11]],"date-time":"2015-07-11T00:57:13Z","timestamp":1436576233000},"page":"277-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Robust optimization approach for a chance-constrained binary knapsack problem"],"prefix":"10.1007","volume":"157","author":[{"given":"Jinil","family":"Han","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kyungsik","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chungmok","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ki-Seok","family":"Choi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sungsoo","family":"Park","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,7,12]]},"reference":[{"issue":"1","key":"931_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1), 1\u201313 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"931_CR2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"931_CR3","doi-asserted-by":"crossref","unstructured":"Bhalgat, A., Goel, A., Khanna, S.: Improved approximation results for stochastic knapsack problems. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, pp. 1647\u20131665 (2011)","DOI":"10.1137\/1.9781611973082.127"},{"key":"931_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"1","key":"931_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-006-9084-x","volume":"130","author":"G Calafiore","year":"2006","unstructured":"Calafiore, G., El Ghaoui, L.: On distributionally robust chance-constrained linear programs. J. Optim. Theory App. 130(1), 1\u201322 (2006)","journal-title":"J. Optim. Theory App."},{"key":"931_CR6","unstructured":"Cohn, A., Barnhart, C.: The stochastic knapsack problem with random weights: a heuristic approach to robust transportation planning. In: Proceedings of the Triennial Symposium on Transportation Analysis (TRISTAN III) (1998)"},{"key":"931_CR7","unstructured":"Fortz, B., Labb\u00e9, M., Louveaux, F., Poss, M.: The knapsack problem with gaussian weights. Technical report. Universit\u00e9 Libre de Bruxelles, Brussels, Belgium (2008)"},{"key":"931_CR8","doi-asserted-by":"crossref","unstructured":"Goel, A., Indyk, P.: Stochastic load balancing and related problems. In: 40th Annual Symposium on Foundations of Computer Science, pp. 579\u2013586 (1999)","DOI":"10.1109\/SFFCS.1999.814632"},{"issue":"1","key":"931_CR9","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s10479-014-1618-2","volume":"223","author":"M Goerigk","year":"2014","unstructured":"Goerigk, M.: A note on upper bounds to the robust knapsack problem with discrete scenarios. Ann. Oper. Res. 223(1), 461\u2013469 (2014)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"931_CR10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.orl.2010.01.003","volume":"38","author":"V Goyal","year":"2010","unstructured":"Goyal, V., Ravi, R.: A PTAS for the chance-constrained knapsack problem with random item sizes. Oper. Res. Lett. 38(3), 161\u2013164 (2010)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"931_CR11","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1287\/ijoc.1120.0523","volume":"25","author":"J Han","year":"2013","unstructured":"Han, J., Lee, K., Lee, C., Park, S.: Exact algorithms for a bandwidth packing problem with queueing delay guarantees. INFORMS J. Comput. 25(3), 585\u2013596 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"931_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/A:1009821323279","volume":"3","author":"H Iida","year":"1999","unstructured":"Iida, H.: A note on the max\u2013min 0\u20131 knapsack problem. J. Comb. Optim. 3(1), 89\u201394 (1999)","journal-title":"J. Comb. Optim."},{"key":"931_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"issue":"1","key":"931_CR14","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/S0097539797329142","volume":"30","author":"J Kleinberg","year":"2000","unstructured":"Kleinberg, J., Rabani, Y., Tardos, \u00c9.: Allocating bandwidth for bursty connections. SIAM J. Comput. 30(1), 191\u2013217 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"931_CR15","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/opre.46.1.17","volume":"46","author":"A Kleywegt","year":"1998","unstructured":"Kleywegt, A., Papastavrou, J.: The dynamic and stochastic knapsack problem. Oper. Res. 46(1), 17\u201335 (1998)","journal-title":"Oper. Res."},{"issue":"1","key":"931_CR16","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1287\/opre.49.1.26.11185","volume":"49","author":"A Kleywegt","year":"2001","unstructured":"Kleywegt, A., Papastavrou, J.: The dynamic and stochastic knapsack problem with random sized items. Oper. Res. 49(1), 26\u201341 (2001)","journal-title":"Oper. Res."},{"key":"931_CR17","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1016\/j.orl.2008.03.006","volume":"36","author":"O Klopfenstein","year":"2008","unstructured":"Klopfenstein, O., Nace, D.: A robust approach to the chance-constrained knapsack problem. Oper. Res. Lett. 36, 628\u2013632 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"931_CR18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.20488","volume":"59","author":"O Klopfenstein","year":"2012","unstructured":"Klopfenstein, O., Nace, D.: Cover inequalities for robust knapsack sets\u2014application to the robust bandwidth packing problem. Networks 59(1), 59\u201372 (2012)","journal-title":"Networks"},{"key":"931_CR19","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10479-009-0577-5","volume":"176","author":"S Kosuch","year":"2010","unstructured":"Kosuch, S., Lisser, A.: Upper bounds for the 0\u20131 stochastic knapsack problem and a B and B algorithm. Ann. Oper. Res. 176, 77\u201393 (2010)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"931_CR20","first-page":"35","volume":"60","author":"C Lee","year":"2012","unstructured":"Lee, C., Lee, K., Park, K., Park, S.: Technical note\u2014branch-and-price-and-cut approach to the robust network design problem without flow bifurcations. Oper. Res. 60(3), 35\u201353 (2012)","journal-title":"Oper. Res."},{"key":"931_CR21","volume-title":"Knapsack Problems","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems. Wiley, New York (1990)"},{"issue":"2","key":"931_CR22","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-011-0443-5","volume":"134","author":"Y Merzifonluo\u011flu","year":"2012","unstructured":"Merzifonluo\u011flu, Y., Geunes, J., Romeijn, H.E.: The static stochastic knapsack problem with normally distributed item sizes. Math. Program. 134(2), 459\u2013489 (2012)","journal-title":"Math. Program."},{"issue":"4","key":"931_CR23","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/120880355","volume":"23","author":"M Monaci","year":"2013","unstructured":"Monaci, M., Pferschy, U.: On the robust knapsack problem. SIAM J. Optim. 23(4), 1956\u20131982 (2013)","journal-title":"SIAM J. Optim."},{"key":"931_CR24","doi-asserted-by":"crossref","first-page":"2625","DOI":"10.1016\/j.cor.2013.05.005","volume":"40","author":"M Monaci","year":"2013","unstructured":"Monaci, M., Pferschy, U., Serafini, P.: Exact solution of the robust knapsack problem. Comput. Oper. Res. 40, 2625\u20132631 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"931_CR25","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D Pisinger","year":"1997","unstructured":"Pisinger, D.: A minimal algorithm for the 0\u20131 knapsack problem. Oper. Res. 45(5), 758\u2013767 (1997)","journal-title":"Oper. Res."},{"key":"931_CR26","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M Savelsbergh","year":"1997","unstructured":"Savelsbergh, M.: A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45, 831\u2013841 (1997)","journal-title":"Oper. Res."},{"issue":"2","key":"931_CR27","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.ejor.2009.05.033","volume":"202","author":"A Sbihi","year":"2010","unstructured":"Sbihi, A.: A cooperative local search-based algorithm for the multiple-scenario max\u2013min knapsack problem. Eur. J. Oper. Res. 202(2), 339\u2013346 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"931_CR28","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/s10957-013-0319-3","volume":"161","author":"F Talla Nobibon","year":"2014","unstructured":"Talla Nobibon, F., Leus, R.: Complexity results and exact algorithms for robust knapsack problems. J. Optim. Theory Appl. 161(2), 533\u2013552 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"6","key":"931_CR29","doi-asserted-by":"crossref","first-page":"2034","DOI":"10.1016\/j.cor.2006.10.002","volume":"35","author":"F Taniguchi","year":"2008","unstructured":"Taniguchi, F., Yamada, T., Kataoka, S.: Heuristic and exact algorithms for the max\u2013min optimization of the multi-scenario knapsack problem. Comput. Oper. Res. 35(6), 2034\u20132048 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"931_CR30","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1287\/opre.44.2.407","volume":"44","author":"G Yu","year":"1996","unstructured":"Yu, G.: On the max\u2013min 0\u20131 knapsack problem with robust optimization applications. Oper. Res. 44(2), 407\u2013415 (1996)","journal-title":"Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0931-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0931-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0931-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:00:08Z","timestamp":1559109608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0931-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,12]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["931"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0931-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,12]]}}}