{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T00:08:22Z","timestamp":1694563702946},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T00:00:00Z","timestamp":1348617600000},"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":[[2013,10]]},"DOI":"10.1007\/s11590-012-0550-0","type":"journal-article","created":{"date-parts":[[2012,9,25]],"date-time":"2012-09-25T20:59:55Z","timestamp":1348606795000},"page":"1471-1480","source":"Crossref","is-referenced-by-count":1,"title":["Modeling and solving profitable location and distribution problems"],"prefix":"10.1007","volume":"7","author":[{"given":"A.","family":"Ceselli","sequence":"first","affiliation":[]},{"given":"G.","family":"Righini","sequence":"additional","affiliation":[]},{"given":"E.","family":"Tresoldi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,26]]},"reference":[{"key":"550_CR1","doi-asserted-by":"crossref","unstructured":"Maranzana, F.E.: On the location of supply points to minimise transport costs. Operat. Res. Quart. 261\u2013270 (1964)","DOI":"10.1057\/jors.1964.47"},{"issue":"2","key":"550_CR2","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0377-2217(89)90188-4","volume":"39","author":"S Salhi","year":"1989","unstructured":"Salhi, S., Rand, G.K.: The effect of ignoring routes when locating depots. Eur. J. Oper. Res. 39(2), 150\u2013156 (1989)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"550_CR3","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0191-2615(85)90052-9","volume":"19","author":"J Perl","year":"1985","unstructured":"Perl, J., Daskin, M.S.: A warehouse location-routing problem. Transp. Res. Part B 19(5), 381\u2013396 (1985)","journal-title":"Transp. Res. Part B"},{"key":"550_CR4","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/j.ejor.2003.04.009","volume":"165","author":"D Ambrosino","year":"2005","unstructured":"Ambrosino, D., Scutell\u00e0, M.G.: Distribution network design: New problems and related models. Eur. J. Oper. Res. 165, 610\u2013624 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"550_CR5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10288-006-0001-9","volume":"4","author":"C Prins","year":"2006","unstructured":"Prins, C., Prodhon, C., Wolfler-Calvo, R.: Solving the capacitated location-routing problem by a grasp complemented by a learning process and a path relinking. 4OR 4, 221\u2013238 (2006)","journal-title":"4OR"},{"key":"550_CR6","doi-asserted-by":"crossref","unstructured":"Boccia, M., Crainic, T.G., Sforza, A., Sterle, C.: A metaheuristic for a two echelon location-routing problem. In: Festa, P. (ed.) International Symphosium on Experimental Algorithms. Lecture Notes in Computer Science, pp. 288\u2013301. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-13193-6_25"},{"key":"550_CR7","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","volume":"177","author":"G Nagy","year":"2007","unstructured":"Nagy, G., Salhi, S.: Location-routing: Issues, models and methods. Eur. J. Oper. Res. 177, 649\u2013672 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"550_CR8","doi-asserted-by":"crossref","unstructured":"Lad\u00e1nyi, L., Ralphs, T.K., Trotter, L.E.: Computational combinatorial optimization: optimal or provably near-optimal solutions. Lecture Notes in Computer Science, chapter Branch, Cut, and Price: Sequential and Parallel, vol. 2241, pp. 223\u2013260. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45586-8_6"},{"key":"550_CR9","doi-asserted-by":"crossref","unstructured":"Desrosiers, J., Desaulniers, G., Solomon, M.M.: Column Generation. Springer, Berlin (2005)","DOI":"10.1007\/b135457"},{"key":"550_CR10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","volume":"3","author":"G Righini","year":"2006","unstructured":"Righini, G., Salani, M.: Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discret. Optim. 3, 255\u2013273 (2006)","journal-title":"Discret. Optim."},{"issue":"5","key":"550_CR11","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.trc.2010.07.008","volume":"19","author":"A Bettinelli","year":"2011","unstructured":"Bettinelli, A., Ceselli, A., Righini, G.: A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transp. Res. Part C Emerg. Technol. 19(5), 723\u2013740 (2011)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"550_CR12","doi-asserted-by":"crossref","unstructured":"Archetti, C., Bouchard, M., Desaulniers, G.: Enhanced branch and price and cut for vehicle routing with split deliveries and time windows. Transp. Sci. (2011)","DOI":"10.1287\/trsc.1100.0363"},{"key":"550_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":"2","key":"550_CR14","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1287\/opre.1070.0449","volume":"56","author":"M Jepsen","year":"2008","unstructured":"Jepsen, M., Petersen, B., Spoorendonk, S., Pisinger, D.: Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2), 497\u2013511 (2008)","journal-title":"Oper. Res."},{"key":"550_CR15","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/trsc.33.1.101","volume":"33","author":"N Kohl","year":"1999","unstructured":"Kohl, N., Desrosiers, J., Madsen, O., Solomon, M., Soumis, F.: 2-path cuts for the vehicle routing problem with time windows. Transp. Sci. 33, 101\u2013116 (1999)","journal-title":"Transp. Sci."},{"key":"550_CR16","unstructured":"Tresoldi, E.: Location and Routing Problems: an Unified Approach. Phd thesis, Universit\u00e0 degli Studi di Milano (2012)"},{"key":"550_CR17","unstructured":"Pessoa, A., Uchoa, E., Poggi de Aragao, M.: A new stabilization method for column generation. Column Generation, Workshop (2008)"},{"key":"550_CR18","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1998)"},{"key":"550_CR19","doi-asserted-by":"crossref","unstructured":"Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100 (2003)","DOI":"10.1007\/s10107-003-0481-8"},{"key":"550_CR20","unstructured":"Macedo, R., Alves, C., Val\u00e9rio de Carvalho, J.M.: Exact algorithms for vehicle routing problems with different service constraints. In: Cologne-Twente Workshop on Graphs and Combinatorial, Optimization, pp. 215\u2013218 (2009)"},{"issue":"12","key":"550_CR21","first-page":"487","volume":"61","author":"J Ahn","year":"2008","unstructured":"Ahn, J., de Weck, O., Hoffman, J.: An optimization framework for global planetary surface exploration campaigns. J. Br. Interplanet. Soc. 61(12), 487\u2013498 (2008)","journal-title":"J. Br. Interplanet. Soc."},{"key":"550_CR22","unstructured":"Ceselli, A., Righini, G., Tresoldi, E.: Combined location and routing problems in drug distribution. In: Cologne-Twente Workshop on Graphs and Combinatorial, Optimization, pp. 113\u2013117 (2011)"},{"issue":"4","key":"550_CR23","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/net.20337","volume":"54","author":"Z Shen","year":"2009","unstructured":"Shen, Z., Ordonez, F., Dessouky, M.: A two-stage vehicle routing model for large-scale bioterrorism emergencies. Networks 54(4), 255\u2013269 (2009)","journal-title":"Networks"},{"issue":"1","key":"550_CR24","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10479-008-0375-5","volume":"167","author":"A Ceselli","year":"2009","unstructured":"Ceselli, A., Liberatore, F., Righini, G.: A computational evaluation of a general branch-and-price framework for capacitated network location problems. Ann. OR 167(1), 209\u2013251 (2009)","journal-title":"Ann. OR"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0550-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0550-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0550-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T05:42:29Z","timestamp":1562218949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0550-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,26]]},"references-count":24,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["550"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0550-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,26]]}}}