{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T14:24:06Z","timestamp":1649168646641},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,3,14]],"date-time":"2013-03-14T00:00:00Z","timestamp":1363219200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s11590-013-0622-9","type":"journal-article","created":{"date-parts":[[2013,3,13]],"date-time":"2013-03-13T12:23:50Z","timestamp":1363177430000},"page":"919-937","source":"Crossref","is-referenced-by-count":3,"title":["A local search heuristic for the Multi-Commodity $$k$$ -splittable Maximum Flow Problem"],"prefix":"10.1007","volume":"8","author":[{"given":"M.","family":"Gamst","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,14]]},"reference":[{"key":"622_CR1","unstructured":"Alvelos, F.: Branch-and-Price and Multicommodity Flows. PhD thesis, Universidade do Minho, Braga (2005)"},{"key":"622_CR2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s00453-005-1167-9","volume":"42","author":"G Baier","year":"2005","unstructured":"Baier, G., Kohler, E., Skutella, M.: On the $k$-splittable flow problem. Algorithmica 42, 231\u2013248 (2005)","journal-title":"Algorithmica"},{"issue":"2","key":"622_CR3","doi-asserted-by":"crossref","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.: Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. 48(2), 318\u2013326 (2000)","journal-title":"Oper. Res."},{"key":"622_CR4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s11590-007-0055-4","volume":"2","author":"M Caramia","year":"2008","unstructured":"Caramia, M., Sgalambro, A.: An exact approach for the maximum concurrent k-splittable flow problem. Optim. Lett. 2, 251\u2013265 (2008)","journal-title":"Optim. Lett."},{"key":"622_CR5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s11590-009-0147-4","volume":"4","author":"M Caramia","year":"2010","unstructured":"Caramia, M., Sgalambro, A.: A fast heuristic algorithm for the maximum concurrent k-splittable flow problem. Optim. Lett. 4, 37\u201355 (2010)","journal-title":"Optim. Lett."},{"key":"622_CR6","unstructured":"Evans, J.W., Filsfils, C.: Deploying IP and MPLS QoS for Multiservice Networks: Theory and Practice. Morgan Kaufmann (2007)"},{"issue":"1","key":"622_CR7","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ejor.2009.05.014","volume":"202","author":"M Gamst","year":"2010","unstructured":"Gamst, M., Jensen, P.N., Pisinger, D., Plum, C.E.M.: Two- and three-index formulations of the minimum cost multicommodity $k$-splittable flow problem. Eur. J. Oper. Res. 202(1), 82\u201389 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"622_CR8","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.ejor.2011.10.001","volume":"217","author":"M Gamst","year":"2012","unstructured":"Gamst, M., Petersen, B.: Comparing branch-and-price algorithms for the multicommodity k-splittable maximum flow problem. Eur. J. Oper. Res. 217, 278\u2013286 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"622_CR9","unstructured":"Koch, R., Skutella, M., Spenke, I.: Maximum $$k$$ -splittable s, t-flows. Theory Comput. Syst. 43(1), 1432\u20134350 (2008)"},{"issue":"1","key":"622_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ipl.2004.12.009","volume":"94","author":"SG Kolliopoulos","year":"2005","unstructured":"Kolliopoulos, S.G.: Minimum-cost single-source 2-splittable flow. Infor. Proces. Lett. 94(1), 15\u201318 (2005)","journal-title":"Infor. Proces. Lett."},{"issue":"2","key":"622_CR11","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1023\/B:COAP.0000008652.29295.eb","volume":"27","author":"T Larsson","year":"2004","unstructured":"Larsson, T., Yuan, D.: An augmented Lagrangian algorithm for large scale multicommodity outing. Comput. Optim. Appl. 27(2), 187\u2013215 (2004)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"622_CR12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1002\/net.20121","volume":"48","author":"M Martens","year":"2006","unstructured":"Martens, M., Skutella, M.: Flows on few paths: algorithms and lower bounds. Networks 48(2), 68\u201376 (2006)","journal-title":"Networks"},{"key":"622_CR13","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.orl.2008.12.004","volume":"37","author":"F Salazar","year":"2009","unstructured":"Salazar, F., Skutella, M.: Single-source k-splittable min-cost flows. Oper. Res. Lett. 37, 71\u201374 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"622_CR14","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.disopt.2008.01.002","volume":"5","author":"J Truffot","year":"2008","unstructured":"Truffot, J., Duhamel, C.: A branch and price algorithm for the $k$-splittable maximum flow problem. Discret. Optim. 5(3), 629\u2013646 (2008)","journal-title":"Discret. Optim."},{"key":"622_CR15","unstructured":"Truffot, J., Duhamel, C., Mahey, P.: Using branch-and-price to solve multicommodity $k$-splittable flow problems.In: Proceedings of International Network Optimization Conference (INOC), In INOC Conference, Lisbonne (2005)"},{"key":"622_CR16","unstructured":"Waissi, G., Setubal, J.: Generator tg (2011) http:\/\/www.informatik.uni-trier.de\/naeher\/Professur\/research\/generators\/maxflow\/tg\/index.html"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0622-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-013-0622-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0622-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:35Z","timestamp":1559409095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-013-0622-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,14]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["622"],"URL":"https:\/\/doi.org\/10.1007\/s11590-013-0622-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,14]]}}}