{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T09:11:04Z","timestamp":1694596264885},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,6,12]],"date-time":"2008-06-12T00:00:00Z","timestamp":1213228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s10479-008-0375-5","type":"journal-article","created":{"date-parts":[[2008,6,11]],"date-time":"2008-06-11T14:38:56Z","timestamp":1213195136000},"page":"209-251","source":"Crossref","is-referenced-by-count":11,"title":["A computational evaluation of a general branch-and-price framework for capacitated network location problems"],"prefix":"10.1007","volume":"167","author":[{"given":"Alberto","family":"Ceselli","sequence":"first","affiliation":[]},{"given":"Federico","family":"Liberatore","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Righini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,6,12]]},"reference":[{"key":"375_CR1","first-page":"149","volume":"81","author":"K. Aardal","year":"1998","unstructured":"Aardal,\u00a0K. (1998). Capacitated facility location: Separation algorithms and computational experience. Mathematical Programming, 81, 149\u2013175.","journal-title":"Mathematical Programming"},{"issue":"1","key":"375_CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10107-005-0700-6","volume":"109","author":"P. Avella","year":"2007","unstructured":"Avella,\u00a0P., Sassano,\u00a0A., & Vasil\u00e9v,\u00a0I. (2007). Computational study of large scale p-median problems. Mathematical Programming A, 109(1), 89\u2013114.","journal-title":"Mathematical Programming A"},{"key":"375_CR3","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0305-0548(00)00072-1","volume":"29","author":"R. Baldacci","year":"2002","unstructured":"Baldacci,\u00a0R., Hadjiconstantinou,\u00a0E., Maniezzo,\u00a0V., & Mingozzi,\u00a0A. (2002). A new method for solving capacitated location problems based on a set partitioning approach. Computers and Operations Research, 29, 365\u2013386.","journal-title":"Computers and Operations Research"},{"key":"375_CR4","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","volume":"21","author":"J.\u00a0E. Beasley","year":"1985","unstructured":"Beasley,\u00a0J.\u00a0E. (1985). A note on solving large p-median problems. European Journal of Operational Research, 21, 270\u2013273.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"375_CR5","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10589-006-6513-6","volume":"35","author":"C. Beltran","year":"2006","unstructured":"Beltran,\u00a0C., Tadonki,\u00a0C., & Vial,\u00a0J. (2006). Solving the p-median problem with a semi-Lagrangian relaxation. Computational Optimization and Applications, 35(2), 239\u2013260.","journal-title":"Computational Optimization and Applications"},{"key":"375_CR6","unstructured":"Ceselli,\u00a0A. (2002). Algoritmi branch and bound e branch and price per il problema delle p-mediane con capacit\u00e0. Master\u2019s thesis, Dipartimento di Tecnologie dell\u2019Informazione, Universit\u00e0 degli Studi di Milano, Crema, Italy (In\u00a0Italian)."},{"issue":"4","key":"375_CR7","first-page":"319","volume":"1","author":"A. Ceselli","year":"2003","unstructured":"Ceselli,\u00a0A. (2003). Two exact algorithms for the capacitated p-median problem. 4OR, 1(4), 319\u2013340.","journal-title":"4OR"},{"issue":"3","key":"375_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20059","volume":"45","author":"A. Ceselli","year":"2005","unstructured":"Ceselli,\u00a0A., & Righini,\u00a0G. (2005). A branch-and-price algorithm for the capacitated p-median problem. Networks, 45(3), 125\u2013142.","journal-title":"Networks"},{"key":"375_CR9","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0377-2217(82)90160-6","volume":"10","author":"N. Christofides","year":"1981","unstructured":"Christofides,\u00a0N., & Beasley,\u00a0J.\u00a0E. (1981). A tree search algorithm for the p-median problem. European Journal of Operational Research, 10, 196\u2013204.","journal-title":"European Journal of Operational Research"},{"key":"375_CR10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0377-2217(83)90179-0","volume":"12","author":"N. Christofides","year":"1983","unstructured":"Christofides,\u00a0N., & Beasley,\u00a0J.\u00a0E. (1983). Extensions to a Lagrangian relaxation approach for the capacitated warehouse location problem. European Journal of Operational Research, 12, 19\u201328.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"375_CR11","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G. Cornueojols","year":"1977","unstructured":"Cornueojols,\u00a0G., Fisher,\u00a0M.\u00a0L., & Nemhauser,\u00a0G.\u00a0L. (1977). Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Management Science, 23(8), 789\u2013810.","journal-title":"Management Science"},{"key":"375_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56082-8_3","volume-title":"Discrete network location models","author":"J. Current","year":"2002","unstructured":"Current,\u00a0J., Daskin,\u00a0M., & Schilling,\u00a0D. (2002). Discrete network location models (pp.\u00a081\u2013118). Berlin: Springer."},{"key":"375_CR13","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1057\/palgrave.jors.2601353","volume":"53","author":"J. A. Diaz","year":"2002","unstructured":"Diaz,\u00a0J. A., & Fern\u00e1ndez,\u00a0E. (2002). A branch-and-price algorithm for the single source capacitated plant location problem. Journal of the Operational Research Society, 53, 728\u2013740.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"375_CR14","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/j.ejor.2004.08.016","volume":"169","author":"J. A. Diaz","year":"2006","unstructured":"Diaz,\u00a0J. A., & Fern\u00e1ndez,\u00a0E. (2006). Hybrid scatter search and path relinking for the capacitated p-median problem. European Journal of Operational Research, 169(2), 570\u2013585.","journal-title":"European Journal of Operational Research"},{"key":"375_CR15","doi-asserted-by":"crossref","unstructured":"Galv\u00e3o,\u00a0R.\u00a0D. (1979). A dual-bounded algorithm for the p-median problem. Operations Research, 28(5).","DOI":"10.1287\/opre.28.5.1112"},{"key":"375_CR16","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P.\u00a0C. Gilmore","year":"1961","unstructured":"Gilmore,\u00a0P.\u00a0C., & Gomory,\u00a0R.\u00a0E. (1961). A linear programming approach to the cutting stock problem. Operations Research, 9, 849\u2013859.","journal-title":"Operations Research"},{"key":"375_CR17","volume-title":"Telecommunication in location","author":"E. Gourdin","year":"2003","unstructured":"Gourdin,\u00a0E., Labb\u00e9,\u00a0M., & Yaman,\u00a0H. (2003). Telecommunication in location (pp.\u00a0275\u2013305). Berlin: Springer."},{"key":"375_CR18","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(85)90012-8","volume":"20","author":"P. Hanjoul","year":"1985","unstructured":"Hanjoul,\u00a0P., & Peeters,\u00a0D. (1985). A comparison of two dual-based procedures for solving the p-median problem. European Journal of Operational Research, 20, 387\u2013396.","journal-title":"European Journal of Operational Research"},{"key":"375_CR19","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M. Held","year":"1974","unstructured":"Held,\u00a0M., Wolfe,\u00a0P., & Crowder,\u00a0H.\u00a0P. (1974). Validation of subgradient optimization. Mathematical Programming, 6, 62\u201388.","journal-title":"Mathematical Programming"},{"key":"375_CR20","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","volume":"113","author":"K. Holmberg","year":"1999","unstructured":"Holmberg,\u00a0K., R\u00f6nnqvist,\u00a0M., & Yuan,\u00a0D. (1999). An exact algorithm for the capacitated facility location problems with single sourcing. European Journal of Operational Research, 113, 544\u2013559.","journal-title":"European Journal of Operational Research"},{"key":"375_CR21","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv,\u00a0O., & Hakimi,\u00a0S.\u00a0L. (1979). Reducibility among combinatorial problems. SIAM Journal of Applied Mathematics, 37, 539\u2013560.","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"5","key":"375_CR22","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1057\/jors.1986.84","volume":"37","author":"J.\u00a0G. Klincewicz","year":"1986","unstructured":"Klincewicz,\u00a0J.\u00a0G., & Luss,\u00a0H. (1986). A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints. Journal of the Operational Research Society, 37(5), 495\u2013500.","journal-title":"Journal of the Operational Research Society"},{"key":"375_CR23","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.ejor.2003.10.031","volume":"162","author":"A. Klose","year":"2004","unstructured":"Klose,\u00a0A., & Drexl,\u00a0A. (2004) Facility location models for distribution system design. European Journal of Operational Research, 162, 4\u201329","journal-title":"European Journal of Operational Research"},{"key":"375_CR24","series-title":"Lecture notes in economics and mathematical systems","volume-title":"An exact column generation approach to the capacitated facility location problem","author":"A. Klose","year":"2004","unstructured":"Klose,\u00a0A., & G\u00f6rtz,\u00a0S. (2004). An exact column generation approach to the capacitated facility location problem. Lecture notes in economics and mathematical systems (Vol.\u00a0544). Berlin: Springer."},{"key":"375_CR25","unstructured":"Labb\u00e9,\u00a0M., & Yaman,\u00a0H. (2003). A note on the projection of polyhedra. Optimization online (p.\u00a0776). Optimization online site: http:\/\/www.optimization-online.org ."},{"key":"375_CR26","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s10589-005-3913-y","volume":"34","author":"M. Labb\u00e9","year":"2006","unstructured":"Labb\u00e9,\u00a0M., & Yaman,\u00a0H. (2006). Polyhedral analysis for concentrator location problem. Computational Optimization and Applications, 34, 377\u2013407","journal-title":"Computational Optimization and Applications"},{"key":"375_CR27","volume-title":"Network routing","author":"M. Labb\u00e9","year":"1995","unstructured":"Labb\u00e9,\u00a0M., Peeters,\u00a0D., & Thisse,\u00a0J.\u00a0F. (1995). Location on networks. In Network routing (Vol.\u00a08). Amsterdam: Elsevier."},{"issue":"6","key":"375_CR28","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1016\/S0305-0548(03)00039-X","volume":"31","author":"L. Lorena","year":"2004","unstructured":"Lorena,\u00a0L., & Senne,\u00a0E. (2004). A column generation approach to capacitated p-median problems. Computers and Operations Research, 31(6), 863\u2013876.","journal-title":"Computers and Operations Research"},{"key":"375_CR29","unstructured":"Martello,\u00a0S., & Toth,\u00a0P. (1981) An algorithm for the generalized assignment problem (pp.\u00a0589\u2013603)."},{"key":"375_CR30","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S. Martello","year":"1990","unstructured":"Martello,\u00a0S., & Toth,\u00a0P. (1990). Knapsack problems: algorithms and computer implementations. New York: Wiley."},{"key":"375_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4975-8","volume-title":"Large scale linear and integer optimization","author":"R.\u00a0K. Martin","year":"1999","unstructured":"Martin,\u00a0R.\u00a0K. (1999). Large scale linear and integer optimization. Boston: Kluwer."},{"issue":"2","key":"375_CR32","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0966-8349(97)00016-8","volume":"5","author":"A.\u00a0T. Murray","year":"1997","unstructured":"Murray,\u00a0A.\u00a0T., & Gerrard,\u00a0R.\u00a0A. (1997). Capacitated service and regional constraints in location-allocation modeling. Location Science, 5(2), 103\u2013118.","journal-title":"Location Science"},{"key":"375_CR33","doi-asserted-by":"crossref","unstructured":"Narula,\u00a0S.\u00a0C., Ogbu,\u00a0U.\u00a0I., & Samuelsson,\u00a0H.\u00a0M. (1977). An algorithm for the p-median problem. Operations Research, 25(4).","DOI":"10.1287\/opre.25.4.709"},{"issue":"11","key":"375_CR34","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1057\/jors.1983.242","volume":"34","author":"A.\u00a0W. Neebe","year":"1983","unstructured":"Neebe,\u00a0A.\u00a0W., & Rao,\u00a0M.\u00a0R. (1983). An algorithm for the fixed charge assigning users to sources problem. Journal of the Operational Research Society, 34(11), 1107\u20131113.","journal-title":"Journal of the Operational Research Society"},{"key":"375_CR35","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0969-6016(94)90032-9","volume":"13","author":"I. H. Osman","year":"1994","unstructured":"Osman,\u00a0I. H., & Christofides,\u00a0N. (1994). Capacitated clustering problems by hybrid simulated annealing and tabu search. International Transactions in Operational Research, 13, 317\u2013336.","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"375_CR36","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0305-0548(87)90022-0","volume":"14","author":"H. Pirkul","year":"1987","unstructured":"Pirkul,\u00a0H. (1987). Efficient algorithms for the capacitated concentrator location problem. Computers and Operations Research, 14(3), 197\u2013208.","journal-title":"Computers and Operations Research"},{"key":"375_CR37","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1068\/b180347","volume":"18","author":"K.\u00a0E. Rosing","year":"1991","unstructured":"Rosing,\u00a0K.\u00a0E. (1991). Towards the solutions of the (generalised) multi-weber problem. Environment and Planning, Series B, 18, 347\u2013360.","journal-title":"Environment and Planning, Series B"},{"key":"375_CR38","doi-asserted-by":"crossref","unstructured":"Savelsbergh,\u00a0M. (1997). A branch-and-price algorithm for the generalized assignment problem. Operations Research, 45(6).","DOI":"10.1287\/opre.45.6.831"},{"issue":"6","key":"375_CR39","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1016\/j.cor.2003.11.024","volume":"32","author":"E.\u00a0L.\u00a0F. Senne","year":"2005","unstructured":"Senne,\u00a0E.\u00a0L.\u00a0F., Lorena,\u00a0L.\u00a0A.\u00a0N., & Pereira,\u00a0M.\u00a0A. (2005). A branch-and-price approach to p-median location problems. Computers and Operations Research, 32(6), 1655\u20131664.","journal-title":"Computers and Operations Research"},{"issue":"11","key":"375_CR40","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1016\/S0305-0548(97)00020-8","volume":"24","author":"S.\u00a0S. Syam","year":"1997","unstructured":"Syam,\u00a0S.\u00a0S. (1997). A model for the capacitated p-facility location problem in global environments. Computers and Operations Research, 24(11), 1005\u20131016.","journal-title":"Computers and Operations Research"},{"key":"375_CR41","doi-asserted-by":"crossref","unstructured":"Van Roy,\u00a0T.\u00a0J., & Erlenkotter,\u00a0D. (1982). Dual-based procedure for dynamic facility location. Management Science, 28(10).","DOI":"10.1287\/mnsc.28.10.1091"},{"key":"375_CR42","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.34.1.145","volume":"34","author":"T.\u00a0J. Roy Van","year":"1986","unstructured":"Van Roy,\u00a0T.\u00a0J., & Erlenkotter,\u00a0D. (1986). A cross decomposition algorithm for capacitated facility location. Operations Research, 34, 145\u2013163.","journal-title":"Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0375-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0375-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0375-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:48Z","timestamp":1559138868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0375-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,12]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["375"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0375-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,12]]}}}