{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T12:56:13Z","timestamp":1770814573448,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,6,18]],"date-time":"2013-06-18T00:00:00Z","timestamp":1371513600000},"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,4]]},"DOI":"10.1007\/s11590-013-0662-1","type":"journal-article","created":{"date-parts":[[2013,6,17]],"date-time":"2013-06-17T03:11:23Z","timestamp":1371438683000},"page":"1375-1387","source":"Crossref","is-referenced-by-count":50,"title":["Service network design models for two-tier city logistics"],"prefix":"10.1007","volume":"8","author":[{"given":"Teodor Gabriel","family":"Crainic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonino","family":"Sgalambro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,6,18]]},"reference":[{"key":"662_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.trc.2008.10.005","volume":"17","author":"J Andersen","year":"2009","unstructured":"Andersen, J., Crainic, T.G., Christiansen, M.: Service network design with asset management: formulations and comparative analyses. Transp. Res. Part C 17, 197\u2013207 (2009)","journal-title":"Transp. Res. Part C"},{"key":"662_CR2","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":"662_CR3","doi-asserted-by":"crossref","unstructured":"Caramia, M., Sgalambro, A.: On the approximation of the single source k-splittable flow problem. J. Discrete Algorithms 6(2), 277\u2013289 (2008)","DOI":"10.1016\/j.jda.2007.03.001"},{"key":"662_CR4","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":"662_CR5","unstructured":"Chouman, M., Crainic, T.G.: A MIP-tabu search hybrid framework for multicommodity capacitated fixed-charge network design. Tech. Rep. CIRRELT-2010-31, Centre interuniversitaire de recherche sur les r\u00e9seaux d\u2019entreprise, la logistique et les transports, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, QC, Canada (2010)"},{"key":"662_CR6","unstructured":"Chouman, M., Crainic, T.G.: Cutting-plane matheuristic for service network design with design-balanced requirements. Transp. Sci. (2013)"},{"key":"662_CR7","unstructured":"Chouman, M., Crainic, T.G., Gendron, B.: Commodity representations and cutset-based inequalities for multicommodity capacitated fixed charge network design. Tech. Rep. CIRRELT-2011-56, Centre interuniversitaire de recherche sur les r\u00e9seaux d\u2019entreprise, la logistique et les transports, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, QC, Canada (2011)"},{"issue":"6","key":"662_CR8","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1016\/j.cor.2003.11.012","volume":"32","author":"AM Costa","year":"2005","unstructured":"Costa, A.M.: A survey on benders decomposition applied to fixed-charge network design problems. Comput. Oper. Res. 32(6), 1429\u20131450 (2005)","journal-title":"Comput. Oper. Res."},{"key":"662_CR9","doi-asserted-by":"crossref","unstructured":"Crainic, T., Mancini, S., Perboli, G., Tadei, R.: Multi-start heuristics for the two-echelon vehicle routing problem. In: Evolutionary computation in combinatorial optimization, vol. 6622, pp. 179\u2013190 (2011)","DOI":"10.1007\/978-3-642-20364-0_16"},{"key":"662_CR10","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(99)00233-7","volume":"122","author":"TG Crainic","year":"2000","unstructured":"Crainic, T.G.: Service network design in freight transportation. Eur. J. Oper. Res. 122, 272\u2013288 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20133","key":"662_CR11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(00)00310-3","volume":"112","author":"TG Crainic","year":"2001","unstructured":"Crainic, T.G., Frangioni, A., Gendron, B.: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math. 112(1\u20133), 73\u201399 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"662_CR12","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1287\/trsc.1090.0279","volume":"43","author":"TG Crainic","year":"2009","unstructured":"Crainic, T.G., Ricciardi, N., Storchi, G.: Models for evaluating and planning city logistics transportation systems. Transp. Sci. 43(4), 432\u2013454 (2009)","journal-title":"Transp. Sci."},{"issue":"5","key":"662_CR13","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1023\/B:HEUR.0000045323.83583.bd","volume":"10","author":"TG Crainic","year":"2004","unstructured":"Crainic, T.G., Gendron, B., Hernu, G.: A slope scaling\/Lagrangian perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. J. Heuristics 10(5), 525\u2013545 (2004)","journal-title":"J. Heuristics"},{"issue":"2","key":"662_CR14","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 multi-commodity k-splittable maximum flow problem. Eur. J. Oper. Res. 217(2), 278\u2013286 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"662_CR15","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.51.4.655.16098","volume":"51","author":"I Ghamlouche","year":"2003","unstructured":"Ghamlouche, I., Crainic, T.G., Gendreau, M.: Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51(4), 655\u2013667 (2003)","journal-title":"Oper. Res."},{"issue":"12","key":"662_CR16","doi-asserted-by":"crossref","first-page":"3215","DOI":"10.1016\/j.cor.2012.04.007","volume":"39","author":"VC Hemmelmayr","year":"2012","unstructured":"Hemmelmayr, V.C., Cordeau, J.F., Crainic, T.G.: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput. Oper. Res. 39(12), 3215\u20133228 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"662_CR17","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1287\/ijoc.1090.0348","volume":"22","author":"M Hewitt","year":"2010","unstructured":"Hewitt, M., Nemhauser, G.L., Savelsbergh, M.W.P.: Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS J. Comput. 22(2), 314\u2013325 (2010)","journal-title":"INFORMS J. Comput."},{"key":"662_CR18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1287\/trsc.1110.0399","volume":"47","author":"M Jepsen","year":"2013","unstructured":"Jepsen, M., Spoorendonk, S., Ropke, S.: A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem. Transp. Sci. 47, 23\u201337 (2013)","journal-title":"Transp. Sci."},{"issue":"1","key":"662_CR19","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.cam.2008.10.055","volume":"232","author":"N Katayama","year":"2009","unstructured":"Katayama, N., Chen, M., Kubo, M.: A capacity scaling heuristic for the multicommodity capacitated network design problem. J. Comput. Appl. Math. 232(1), 90\u2013101 (2009)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"662_CR20","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1287\/trsc.1080.0234","volume":"43","author":"MB Pedersen","year":"2009","unstructured":"Pedersen, M.B., Crainic, T.G., Madsen, O.B.G.: Models and tabu search metaheuristics for service network design with asset-balance requirements. Transp. Sci. 43(2), 158\u2013177 (2009)","journal-title":"Transp. Sci."},{"issue":"4","key":"662_CR21","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1287\/trsc.1110.0368","volume":"45","author":"G Perboli","year":"2011","unstructured":"Perboli, G., Tadei, R., Vigo, D.: The two-echelon capacitated vehicle routing problem: models and math-based heuristics. Transp. Sci. 45(4), 364\u2013380 (2011)","journal-title":"Transp. Sci."},{"key":"662_CR22","unstructured":"Rodr\u00edguez-Mart\u00edn, I., Jos\u00e9 Salazar-Gonz\u00e1lez, J.: A local branching heuristic for the capacitated fixed-charge network design problem. Comput. Oper. Res. 37(3), 575\u2013581 (2010)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0662-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-013-0662-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0662-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T13:58:07Z","timestamp":1563199087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-013-0662-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,18]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["662"],"URL":"https:\/\/doi.org\/10.1007\/s11590-013-0662-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,18]]}}}