{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T20:31:30Z","timestamp":1723149090113},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"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":[[2013,12]]},"DOI":"10.1007\/s10479-013-1394-4","type":"journal-article","created":{"date-parts":[[2013,5,31]],"date-time":"2013-05-31T14:29:21Z","timestamp":1370010561000},"page":"193-207","source":"Crossref","is-referenced-by-count":3,"title":["The planar hub location problem: a probabilistic clustering approach"],"prefix":"10.1007","volume":"211","author":[{"given":"Cem","family":"Iyigun","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,1]]},"reference":[{"key":"1394_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"S. Alumur","year":"2008","unstructured":"Alumur, S., & Kara, B. Y. (2008). Network hub location problems: the state of the art. European Journal of Operational Research, 190, 1\u201321.","journal-title":"European Journal of Operational Research"},{"key":"1394_CR2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1287\/trsc.22.2.155","volume":"22","author":"T. Aykin","year":"1988","unstructured":"Aykin, T. (1988). On the location of hub facilities. Transportation Science, 22, 155\u2013157.","journal-title":"Transportation Science"},{"key":"1394_CR3","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0377-2217(93)E0173-U","volume":"83","author":"T. Aykin","year":"1995","unstructured":"Aykin, T. (1995). The hub location and routing problem. European Journal of Operational Research, 83, 200\u2013219.","journal-title":"European Journal of Operational Research"},{"key":"1394_CR4","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/trsc.26.3.212","volume":"26","author":"T. Aykin","year":"1992","unstructured":"Aykin, T., & Brown, G. F. (1992). Interacting new facilities and location\u2013allocation problem. Transportation Science, 26, 212\u2013222.","journal-title":"Transportation Science"},{"key":"1394_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00357-008-9002-z","volume":"25","author":"A. Ben-Israel","year":"2008","unstructured":"Ben-Israel, A., & Iyigun, C. (2008). Probabilistic distance clustering. Journal of Classification, 25, 5\u201326.","journal-title":"Journal of Classification"},{"key":"1394_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1111\/j.1538-4632.1998.tb00405.x","volume":"30","author":"D. L. Bryan","year":"1998","unstructured":"Bryan, D. L. (1998). Extensions to the hub location problem: formulations and numerical examples. Geographical Analysis, 30, 315\u2013330.","journal-title":"Geographical Analysis"},{"key":"1394_CR7","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1111\/1467-9787.00134","volume":"39","author":"D. L. Bryan","year":"1999","unstructured":"Bryan, D. L., & O\u2019Kelly, M. E. (1999). Hub-and-spoke networks in air transportation: an analytical review. Journal of Regional Science, 39, 275\u2013295.","journal-title":"Journal of Regional Science"},{"key":"1394_CR8","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1016\/j.cor.2006.07.002","volume":"35","author":"R. S. Camargo","year":"2008","unstructured":"Camargo, R. S., de Miranda, G., Luna, H. P. L., & Bender\u2019s, H. P. L. (2008). Decomposition for the uncapacitated multiple allocation hub location problem. Computers & Operations Research, 35, 1047\u20131064.","journal-title":"Computers & Operations Research"},{"key":"1394_CR9","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","volume":"72","author":"J. F. Campbell","year":"1994","unstructured":"Campbell, J. F. (1994a). Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72, 387\u2013405.","journal-title":"European Journal of Operational Research"},{"key":"1394_CR10","first-page":"31","volume":"6","author":"J. F. Campbell","year":"1994","unstructured":"Campbell, J. F. (1994b). Survey of network hub location. Studies in Locational Analysis, 6, 31\u201349.","journal-title":"Studies in Locational Analysis"},{"key":"1394_CR11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.1120.0410","volume":"46","author":"J. F. Campbell","year":"2012","unstructured":"Campbell, J. F., & O\u2019Kelly, M. E. (2012). Twenty-five years of hub-location problem. Transportation Science, 46, 153\u2013169.","journal-title":"Transportation Science"},{"key":"1394_CR12","doi-asserted-by":"crossref","first-page":"1477","DOI":"10.1287\/opre.1110.0965","volume":"59","author":"I. Contreras","year":"2011","unstructured":"Contreras, I., Cordeau, J.-F., & Laporte, G. (2011). Bender\u2019s decomposition for large-scale uncapacitated hub location. Operations Research, 59, 1477\u20131490.","journal-title":"Operations Research"},{"key":"1394_CR13","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1006005","volume":"6","author":"L. Cooper","year":"1964","unstructured":"Cooper, L. (1964). Heuristic methods for location\u2013allocation problems. SIAM Review, 6, 37\u201353.","journal-title":"SIAM Review"},{"key":"1394_CR14","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/trsc.18.4.351","volume":"18","author":"Z. Drezner","year":"1984","unstructured":"Drezner, Z. (1984). The planar two-center and two-median problems. Transportation Science, 18, 351\u2013361.","journal-title":"Transportation Science"},{"key":"1394_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56082-8","volume-title":"Facility location: applications and theory","author":"Z. Drezner","year":"2002","unstructured":"Drezner, Z., Klamroth, K., Sch\u00f6bel, A., & Wesolowsky, G. O. (2002). The Weber problem. In Z. Drezner & H. W. Hamacher (Eds.), Facility location: applications and theory. Berlin: Springer."},{"key":"1394_CR16","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","volume":"4","author":"A. T. Ernst","year":"1996","unstructured":"Ernst, A. T., & Krishnamoorthy, M. (1996). Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science, 4, 139\u2013154.","journal-title":"Location Science"},{"key":"1394_CR17","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0377-2217(96)00340-2","volume":"104","author":"A. T. Ernst","year":"1998","unstructured":"Ernst, A. T., & Krishnamoorthy, M. (1998). Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problems. European Journal of Operational Research, 104, 100\u2013112.","journal-title":"European Journal of Operational Research"},{"key":"1394_CR18","unstructured":"Ernst, A. T., Hamacher, H., Jiang, H., Krishnamoorthy, M., & Woeginger, G. (2002). Heuristic algorithms for the uncapacitated hub center single allocation problem. Unpublished Report, CSIRO Mathematical and Information Sciences, Australia"},{"key":"1394_CR19","doi-asserted-by":"crossref","first-page":"3136","DOI":"10.1016\/j.cor.2009.01.010","volume":"36","author":"E. O. Gavriliouk","year":"2009","unstructured":"Gavriliouk, E. O. (2009). Aggregation in hub location problems. Computers & Operations Research, 36, 3136\u20133142.","journal-title":"Computers & Operations Research"},{"key":"1394_CR20","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.dam.2003.09.011","volume":"145","author":"H. W. Hamacher","year":"2004","unstructured":"Hamacher, H. W., Labb\u00e9, M., Nickel, S., & Sonneborn, T. (2004). Adapting polyhedral properties from facility to hub location problems. Discrete Applied Mathematics, 145, 104\u2013116.","journal-title":"Discrete Applied Mathematics"},{"key":"1394_CR21","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.orl.2009.11.005","volume":"38","author":"C. Iyigun","year":"2010","unstructured":"Iyigun, C., & Ben-Israel, A. (2010). A\u00a0generalized Weiszfeld method for the multi-facility location problem. Operations Research Letters, 38, 207\u2013214.","journal-title":"Operations Research Letters"},{"key":"1394_CR22","unstructured":"Iyigun, C., & Ben-Israel, A. (2013). The multi-facility location problem: a probabilistic decomposition method. Computational Optmization and Applications, to appear."},{"issue":"2","key":"1394_CR23","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-004-0531-x","volume":"102","author":"M. Labb\u00e9","year":"2005","unstructured":"Labb\u00e9, M., Yaman, H., & Gourdin, E. (2005). A branch and cut algorithm for hub location problems with single assignment. Mathematical Programming: Series A and B, 102(2), 371\u2013405.","journal-title":"Mathematical Programming: Series A and B"},{"key":"1394_CR24","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N. Megiddo","year":"1984","unstructured":"Megiddo, N., & Supowit, K. J. (1984). On the complexity of some common geometric location problems. SIAM Journal on Computing, 13, 182\u2013196.","journal-title":"SIAM Journal on Computing"},{"key":"1394_CR25","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1287\/trsc.20.2.92","volume":"20","author":"M. E. O\u2019Kelly","year":"1986","unstructured":"O\u2019Kelly, M. E. (1986). The location of interacting hub facilities. Transportation Science, 20, 92\u2013106.","journal-title":"Transportation Science"},{"key":"1394_CR26","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","volume":"32","author":"M. E. O\u2019Kelly","year":"1987","unstructured":"O\u2019Kelly, M. E. (1987). A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32, 393\u2013404.","journal-title":"European Journal of Operational Research"},{"key":"1394_CR27","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF02060486","volume":"40","author":"M. E. O\u2019Kelly","year":"1992","unstructured":"O\u2019Kelly, M. E. (1992). A clustering approach to the planar hub location problem. Annals of Operations Research, 40, 339\u2013353.","journal-title":"Annals of Operations Research"},{"key":"1394_CR28","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0966-8349(96)00015-0","volume":"4","author":"M. E. O\u2019Kelly","year":"1996","unstructured":"O\u2019Kelly, M. E., Bryan, D., Skorin-Kapov, D., & Skorin-Kapov, J. (1996). Hub network design with single and multiple allocation: a computational study. Location Science, 4, 125\u2013138.","journal-title":"Location Science"},{"key":"1394_CR29","volume-title":"Cluster analysis algorithms for data reduction and classification","author":"H. Sp\u00e4th","year":"1980","unstructured":"Sp\u00e4th, H. (1980). Cluster analysis algorithms for data reduction and classification. Upper Saddle River: Ellis Horwood."},{"key":"1394_CR30","first-page":"65","volume":"8","author":"M. Teboulle","year":"2007","unstructured":"Teboulle, M. (2007). A unified continuous optimization framework for center-based clustering methods. Machine Learning, 8, 65\u2013102.","journal-title":"Machine Learning"},{"key":"1394_CR31","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/PL00011435","volume":"90","author":"Y. Vardi","year":"2001","unstructured":"Vardi, Y., & Zhang, C.-H. (2001). A modified Weiszfeld algorithm for the Fermat\u2013Weber location problem. Mathematical Programming Series A, 90, 559\u2013566.","journal-title":"Mathematical Programming Series A"},{"key":"1394_CR32","first-page":"355","volume":"43","author":"E. Weiszfeld","year":"1937","unstructured":"Weiszfeld, E. (1937). Sur le point par lequel la somme des distances de n points donn\u00e9s est minimum. Tohoku Mathematical Journal, 43, 355\u2013386.","journal-title":"Tohoku Mathematical Journal"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1394-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-013-1394-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1394-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:43Z","timestamp":1559153383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-013-1394-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,1]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["1394"],"URL":"https:\/\/doi.org\/10.1007\/s10479-013-1394-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,1]]}}}