{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T00:07:08Z","timestamp":1773965228085,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T00:00:00Z","timestamp":1632873600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T00:00:00Z","timestamp":1632873600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"national research foundation of korea","doi-asserted-by":"crossref","award":["NRF-2021R1F1A1048540"],"award-info":[{"award-number":["NRF-2021R1F1A1048540"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002486","name":"Hankuk University of Foreign Studies","doi-asserted-by":"crossref","award":["2018"],"award-info":[{"award-number":["2018"]}],"id":[{"id":"10.13039\/501100002486","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10479-021-04292-w","type":"journal-article","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T20:03:09Z","timestamp":1632945789000},"page":"251-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A branch and price approach for the robust bandwidth packing problem with queuing delays"],"prefix":"10.1007","volume":"307","author":[{"given":"Seohee","family":"Kim","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0274-6928","authenticated-orcid":false,"given":"Chungmok","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,29]]},"reference":[{"key":"4292_CR1","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Prentice hall."},{"issue":"3","key":"4292_CR2","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/S0377-2217(97)00401-3","volume":"112","author":"A Amiri","year":"1999","unstructured":"Amiri, A., Rolland, E., & Barkhi, R. (1999). Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures. European Journal of Operational Research, 112(3), 635\u2013645.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"4292_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF02022997","volume":"41","author":"CA Anderson","year":"1993","unstructured":"Anderson, C. A., Fraughnaugh, K., Parker, M., & Ryan, J. (1993). Path assignment for call routing: An application of tabu search. Annals of Operations Research, 41(4), 299\u2013312.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"4292_CR4","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1287\/opre.48.2.318.12378","volume":"48","author":"C Barnhart","year":"2000","unstructured":"Barnhart, C., Hane, C. A., & Vance, P. H. (2000). Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research, 48(2), 318\u2013326.","journal-title":"Operations Research"},{"issue":"1","key":"4292_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., & Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35\u201353.","journal-title":"Operations Research"},{"issue":"1","key":"4292_CR6","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1287\/opre.1050.0238","volume":"54","author":"D Bertsimas","year":"2006","unstructured":"Bertsimas, D., & Thiele, A. (2006). A robust optimization approach to inventory theory. Operations Research, 54(1), 150\u2013168.","journal-title":"Operations Research"},{"key":"4292_CR7","unstructured":"Cox, L. A. J. (1991). Dynamic anticipatory routing in circuit-switched telecommunications networks. Handbook of Genetic Algorithms."},{"issue":"6","key":"4292_CR8","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/j.orl.2005.01.004","volume":"33","author":"S Elhedhli","year":"2005","unstructured":"Elhedhli, S. (2005). Exact solution of a class of nonlinear knapsack problems. Operations Research Letters, 33(6), 615\u2013624.","journal-title":"Operations Research Letters"},{"issue":"3","key":"4292_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1287\/ijoc.2.3.236","volume":"2","author":"B Gavish","year":"1990","unstructured":"Gavish, B., & Altinkemer, K. (1990). Backbone network design tools with economic tradeoffs. ORSA Journal on Computing, 2(3), 236\u2013252.","journal-title":"ORSA Journal on Computing"},{"issue":"3","key":"4292_CR10","doi-asserted-by":"publisher","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. (2013). Exact algorithms for a bandwidth packing problem with queueing delay guarantees. INFORMS Journal on Computing, 25(3), 585\u2013596.","journal-title":"INFORMS Journal on Computing"},{"key":"4292_CR11","doi-asserted-by":"crossref","unstructured":"Kim, J. H., Kim, W. C., & Fabozzi, F. J. (2017). Recent advancements in robust optimization for investment management. Annals of Operations Research, 1\u201316.","DOI":"10.1007\/s10479-017-2573-5"},{"issue":"5","key":"4292_CR12","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1016\/j.orl.2008.03.006","volume":"36","author":"O Klopfenstein","year":"2008","unstructured":"Klopfenstein, O., & Nace, D. (2008). A robust approach to the chance-constrained knapsack problem. Operations Research Letters, 36(5), 628\u2013632.","journal-title":"Operations Research Letters"},{"issue":"1","key":"4292_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.20488","volume":"59","author":"O Klopfenstein","year":"2012","unstructured":"Klopfenstein, O., & Nace, D. (2012). Cover inequalities for robust knapsack sets-application to the robust bandwidth packing problem. Networks, 59(1), 59\u201372.","journal-title":"Networks"},{"issue":"4","key":"4292_CR14","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1287\/mnsc.39.4.492","volume":"39","author":"M Laguna","year":"1993","unstructured":"Laguna, M., & Glover, F. (1993). Bandwidth packing: A Tabu search approach. Management Science, 39(4), 492\u2013500.","journal-title":"Management Science"},{"issue":"3","key":"4292_CR15","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1287\/opre.1120.1049","volume":"60","author":"C Lee","year":"2012","unstructured":"Lee, C., Lee, K., Park, K., & Park, S. (2012). Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations. Operations Research, 60(3), 604\u2013610.","journal-title":"Operations Research"},{"issue":"9","key":"4292_CR16","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1057\/jors.2011.136","volume":"63","author":"C Lee","year":"2012","unstructured":"Lee, C., Lee, K., & Park, S. (2012). Robust vehicle routing problem with deadlines and travel time\/demand uncertainty. Journal of the Operational Research Society, 63(9), 1294\u20131306.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"4292_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.21486","volume":"62","author":"C Lee","year":"2013","unstructured":"Lee, C., Lee, K., & Park, S. (2013). Benders decomposition approach for the robust network design problem with flow bifurcations. Networks, 62(1), 1\u201316.","journal-title":"Networks"},{"issue":"11","key":"4292_CR18","doi-asserted-by":"publisher","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. (2013). Exact solution of the robust knapsack problem. Computers & Operations Research, 40(11), 2625\u20132631.","journal-title":"Computers & Operations Research"},{"issue":"9","key":"4292_CR19","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1287\/mnsc.42.9.1277","volume":"42","author":"K Park","year":"1996","unstructured":"Park, K., Kang, S., & Park, S. (1996). An integer programming approach to the bandwidth packing problem. Management Science, 42(9), 1277\u20131291.","journal-title":"Management Science"},{"issue":"1","key":"4292_CR20","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF02109857","volume":"2","author":"M Parker","year":"1993","unstructured":"Parker, M., & Ryan, J. (1993). A column generation algorithm for bandwidth packing. Telecommunication Systems, 2(1), 185\u2013195.","journal-title":"Telecommunication Systems"},{"issue":"2","key":"4292_CR21","doi-asserted-by":"publisher","first-page":"161","DOI":"10.6028\/jres.111.015","volume":"111","author":"C Villa","year":"2006","unstructured":"Villa, C., & Hoffman, K. (2006). A column-generation and branch-and-cut approach to the bandwidth-packing problem. Journal of Research of the National Institute of Standards and Technology, 111(2), 161.","journal-title":"Journal of Research of the National Institute of Standards and Technology"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04292-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04292-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04292-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,15]],"date-time":"2021-11-15T16:29:21Z","timestamp":1636993761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04292-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,29]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["4292"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04292-w","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,29]]},"assertion":[{"value":"10 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}