{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:38:38Z","timestamp":1759847918195,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,2,9]],"date-time":"2016-02-09T00:00:00Z","timestamp":1454976000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada (CA)","doi-asserted-by":"publisher","award":["386501-2010"],"award-info":[{"award-number":["386501-2010"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002381","name":"Indian Institute of Management Ahmedabad (IN)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002381","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s11590-016-1005-9","type":"journal-article","created":{"date-parts":[[2016,2,9]],"date-time":"2016-02-09T10:45:20Z","timestamp":1455014720000},"page":"225-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A cutting plane approach to combinatorial bandwidth packing problem with queuing delays"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5321-8519","authenticated-orcid":false,"given":"Sachin","family":"Jayaswal","sequence":"first","affiliation":[]},{"given":"Navneet","family":"Vidyarthi","sequence":"additional","affiliation":[]},{"given":"Sagnik","family":"Das","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,9]]},"reference":[{"key":"1005_CR1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1023\/A:1021832618060","volume":"4","author":"A Amiri","year":"2003","unstructured":"Amiri, A.: The multi-hour bandwidth packing problem with response time guarantees. Inform. Technol. Manag. 4, 113\u2013127 (2003)","journal-title":"Inform. Technol. Manag."},{"issue":"1","key":"1005_CR2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.ejor.2004.02.026","volume":"167","author":"A Amiri","year":"2005","unstructured":"Amiri, A.: The selection and scheduling of telecommunication calls with time windows. Eur. J. Oper. Res. 167(1), 243\u2013256 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"1005_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0305-0548(99)00004-0","volume":"27","author":"A Amiri","year":"2000","unstructured":"Amiri, A., Barkhi, R.: The multi-hour bandwidth packing problem. Comput. Oper. Res. 27, 1\u201314 (2000)","journal-title":"Comput. Oper. Res."},{"key":"1005_CR4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.ejor.2010.08.005","volume":"208","author":"A Amiri","year":"2011","unstructured":"Amiri, A., Barkhi, R.: The combinatorial bandwidth packing problem. Eur. J. Oper. Res. 208, 37\u201345 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"1005_CR5","doi-asserted-by":"crossref","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.: Bandwidth packing with queuing delay costs: bounding and heuristic procedures. Eur. J. Oper. Res. 112, 635\u2013645 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"1005_CR6","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF02022997","volume":"41","author":"C Anderson","year":"1993","unstructured":"Anderson, C., Fraughnaugh, K., Parkner, M., Ryan, J.: Path assignment for call routing: an application of tabu search. Ann. Oper. Res. 41, 301\u2013312 (1993)","journal-title":"Ann. Oper. Res."},{"key":"1005_CR7","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.ejor.2007.09.011","volume":"192","author":"I Bose","year":"2009","unstructured":"Bose, I.: Bandwidth packing with priority classes. Eur. J. Oper. Res. 192, 313\u2013325 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"1005_CR8","unstructured":"Cox, L., Davis, L., Qui, Y.: Dynamic anticipatory routing in circuit-switched telecommunications networks. In: Davis, L. (ed.). Handbook of Genetic Algorithms, vol. 11, pp 229\u2013340. Van Norstrand\/Reinhold, New York (1991)"},{"issue":"6","key":"1005_CR9","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.orl.2005.01.004","volume":"33","author":"S Elhedhli","year":"2005","unstructured":"Elhedhli, S.: Exact solution of a class of nonlinear knapsack problems. Oper. Res. Lett. 33(6), 615\u2013624 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"10","key":"1005_CR10","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1109\/TCOM.1983.1095752","volume":"31","author":"B Gavish","year":"1983","unstructured":"Gavish, B., Hantler, S.: An algorithm for optimal route selection in SNA networks. IEEE Trans. Commun. 31(10), 1154\u20131161 (1983)","journal-title":"IEEE Trans. Commun."},{"key":"1005_CR11","doi-asserted-by":"publisher","unstructured":"Han, J., Lee, K., Lee, C., Park, S.: Exact algorithms for a bandwidth packing problem with queueing delay guarantees. INFORMS J. Comput. (2012). doi: 10.1287\/ijoc.1120.0523","DOI":"10.1287\/ijoc.1120.0523"},{"key":"1005_CR12","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.39.4.492","volume":"39","author":"M Laguna","year":"1993","unstructured":"Laguna, M., Glover, F.: Bandwidth packing: a tabu search approach. Manag. Sci. 39, 492\u2013500 (1993)","journal-title":"Manag. Sci."},{"key":"1005_CR13","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1287\/mnsc.42.9.1277","volume":"42","author":"K Park","year":"1996","unstructured":"Park, K., Kang, S., Park, S.: An integer programming approach to the bandwidth packing problem. Manag. Sci. 42, 1277\u20131291 (1996)","journal-title":"Manag. Sci."},{"issue":"1","key":"1005_CR14","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF02109857","volume":"2","author":"M Parker","year":"1993","unstructured":"Parker, M., Ryan, J.: A column generation algorithm for bandwidth packing. Telecommun. Syst. 2(1), 185\u2013195 (1993)","journal-title":"Telecommun. Syst."},{"key":"1005_CR15","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1016\/S0305-0548(98)00096-3","volume":"26","author":"E Rolland","year":"1999","unstructured":"Rolland, E., Amiri, A., Barkhi, R.: Queueing delay guarantees in bandwidth packing. Comput. Oper. Res. 26, 921\u2013935 (1999)","journal-title":"Comput. Oper. Res."},{"key":"1005_CR16","doi-asserted-by":"publisher","unstructured":"Vidyarthi, N., Jayaswal, S., Tirumala Chetty, V.B.: Exact solution to bandwidth packing problem with queuing delays. J. Glob. Optim. (2016). doi: 10.1007\/s10898-015-0399-8","DOI":"10.1007\/s10898-015-0399-8"},{"key":"1005_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.6028\/jres.111.015","volume":"111","author":"C Villa","year":"2006","unstructured":"Villa, C., Hoffman, K.: A column-generation and branch-and-cut approach to the bandwidth-packing problem. J. Res. Natl. Instit. Stand. Technol. 111, 161\u2013185 (2006)","journal-title":"J. Res. Natl. Instit. Stand. Technol."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1005-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1005-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1005-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1005-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:44Z","timestamp":1559394704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1005-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,9]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["1005"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1005-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2016,2,9]]}}}