{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T01:28:45Z","timestamp":1775525325054,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,8,23]],"date-time":"2018-08-23T00:00:00Z","timestamp":1534982400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10479-018-3014-9","type":"journal-article","created":{"date-parts":[[2018,8,23]],"date-time":"2018-08-23T02:14:32Z","timestamp":1534990472000},"page":"367-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem"],"prefix":"10.1007","volume":"275","author":[{"given":"Chandra Ade","family":"Irawan","sequence":"first","affiliation":[]},{"given":"Martino","family":"Luis","sequence":"additional","affiliation":[]},{"given":"Said","family":"Salhi","sequence":"additional","affiliation":[]},{"given":"Arif","family":"Imran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"issue":"1","key":"3014_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10479-012-1221-3","volume":"222","author":"MH Aky\u00fcs","year":"2014","unstructured":"Aky\u00fcs, M. H., Altnel, I. K., & \u00d6ncan, T. (2014). Location and allocation based branch and bound algorithms for the capacitated multi-facility weber problem. Annals of Operations Research, 222(1), 45\u201371.","journal-title":"Annals of Operations Research"},{"key":"3014_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/nav.20176","volume":"54","author":"N Aras","year":"2007","unstructured":"Aras, N., Altnel, I. K., & Orbay, M. (2007a). New heuristic methods for the capacitated multi-facility weber problem. Naval Research Logistics, 54, 21\u201332.","journal-title":"Naval Research Logistics"},{"key":"3014_CR3","first-page":"91","volume-title":"Progress in complex systems optimization: Metaheuristics","author":"N Aras","year":"2007","unstructured":"Aras, N., Yumusak, S., & Altnel, I. K. (2007b). Solving the capacitated multi-facility weber problem by simulated annealing, threshold accepting and genetic algorithms. In K. F. Doerner, P. G. Gendreau, W. J. Gutjahr, R. F. Hartl, & M. Reimann (Eds.), Progress in complex systems optimization: Metaheuristics (pp. 91\u2013112). Berlin: Springer."},{"key":"3014_CR4","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1057\/palgrave.jors.2602262","volume":"59","author":"N Aras","year":"2008","unstructured":"Aras, N., Orbay, M., & Altnel, I. K. (2008). Efficient heuristics for the rectilinear distance capacitated multi-facility weber problem. Journal of the Operational Research Society, 59, 64\u201379.","journal-title":"Journal of the Operational Research Society"},{"key":"3014_CR5","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1016\/j.ijpe.2005.08.010","volume":"103","author":"MA Arostegui Jr","year":"2008","unstructured":"Arostegui, M. A, Jr., Kadipasaoglu, S. N., & Khumawala, B. M. (2008). An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems. International Journal of Production Economics, 103, 742\u2013754.","journal-title":"International Journal of Production Economics"},{"key":"3014_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.ijpe.2012.10.019","volume":"145","author":"N Aydin","year":"2013","unstructured":"Aydin, N., & Murat, A. (2013). A swarm intelligence based sample average approximation algorithm for the capacitated reliable facility location problem. International Journal of Production Economics, 145, 173\u2013183.","journal-title":"International Journal of Production Economics"},{"key":"3014_CR7","first-page":"1","volume":"10","author":"J Brimberg","year":"1996","unstructured":"Brimberg, J., & Mladenovi\u0107, N. (1996). A variable neighbourhood algorithm for solving the continuous location-allocation problem. Studies of Locational Analysis, 10, 1\u201312.","journal-title":"Studies of Locational Analysis"},{"key":"3014_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10479-005-2041-5","volume":"136","author":"J Brimberg","year":"2005","unstructured":"Brimberg, J., & Salhi, S. (2005). A continuous location-allocation problem with zone-dependent fixed cost. Annals of Operations Research, 136, 99\u2013115.","journal-title":"Annals of Operations Research"},{"key":"3014_CR9","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1287\/opre.48.3.444.12431","volume":"48","author":"J Brimberg","year":"2000","unstructured":"Brimberg, J., Hansen, P., Mladenovi\u0107, N., & Taillard, E. D. (2000). Improvements and comparison of heuristics for solving the uncapacitated multisource weber problem. Operations Research, 48, 444\u2013460.","journal-title":"Operations Research"},{"key":"3014_CR10","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1057\/palgrave.jors.2601754","volume":"55","author":"J Brimberg","year":"2004","unstructured":"Brimberg, J., Mladenovi\u0107, N., & Salhi, S. (2004). The multi-source weber problem with constant opening cost. Journal of the Operational Research Society, 55, 640\u2013646.","journal-title":"Journal of the Operational Research Society"},{"key":"3014_CR11","first-page":"1","volume":"5","author":"J Brimberg","year":"2008","unstructured":"Brimberg, J., Hansen, P., Mladenovi\u0107, N., & Salhi, S. (2008). A survey of solution methods for the continuous location-allocation problem. International Journal of Operations Research, 5, 1\u201312.","journal-title":"International Journal of Operations Research"},{"key":"3014_CR12","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.ejor.2013.06.022","volume":"232","author":"J Brimberg","year":"2014","unstructured":"Brimberg, J., Drezner, Z., Mladenovi\u0107, N., & Salhi, S. (2014). A new local search for continuous location problems. European Journal of Operational Research, 232, 256\u2013265.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"3014_CR13","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1016\/j.tre.2007.09.001","volume":"44","author":"CH Chen","year":"2008","unstructured":"Chen, C. H., & Ting, C. J. (2008). Combining Lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem. Transportation Research Part E: Logistics and Transportation Review, 44(6), 1099\u20131122.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"3014_CR14","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.comgeo.2009.12.003","volume":"43","author":"N Chernov","year":"2010","unstructured":"Chernov, N., Stoyan, Y., & Romanova, T. (2010). Mathematical model and efficient algorithms for objects packing problem. Computational Geometry: Theory and Applications, 43, 535\u2013553.","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1","key":"3014_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10479-007-0193-1","volume":"157","author":"AI Contreras","year":"2008","unstructured":"Contreras, A. I., & D\u00edaz, J. A. (2008). Scatter search for the single source capacitated facility location problem. Annals of Operations Research, 157(1), 73\u201389.","journal-title":"Annals of Operations Research"},{"key":"3014_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1137\/1006005","volume":"6","author":"L Cooper","year":"1964","unstructured":"Cooper, L. (1964). Heuristic methods for location-allocation problems. SIAM Review, 6, 37\u201353.","journal-title":"SIAM Review"},{"key":"3014_CR17","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/opre.20.1.94","volume":"20","author":"L Cooper","year":"1972","unstructured":"Cooper, L. (1972). The transportation-location problem. Operations Research, 20, 94\u2013108.","journal-title":"Operations Research"},{"key":"3014_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1026146507143","volume":"122","author":"I Correia","year":"2003","unstructured":"Correia, I., & Captivo, M. E. (2003). A Lagrangean heuristic for a modular capacitated location problem. Annals of Operations Research, 122, 141\u2013161.","journal-title":"Annals of Operations Research"},{"key":"3014_CR19","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.ejor.2009.10.027","volume":"204","author":"I Correia","year":"2010","unstructured":"Correia, I., Gouveia, L., & Saldanha-da Gama, F. (2010a). Discretized formulations for capacitated location problems with modular distribution costs. European Journal of Operational Research, 204, 237\u2013244.","journal-title":"European Journal of Operational Research"},{"key":"3014_CR20","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.trb.2009.12.016","volume":"44","author":"I Correia","year":"2010","unstructured":"Correia, I., Nickel, S., & Saldanha-da Gama, F. (2010b). Single-assignment hub location problems with multiple capacity levels. Transportation Research Part B, 44, 1047\u20131066.","journal-title":"Transportation Research Part B"},{"key":"3014_CR21","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1002\/nav.20284","volume":"55","author":"MS Daskin","year":"2008","unstructured":"Daskin, M. S. (2008). What you should know about location modelling. Naval Research Logistics, 55, 283\u2013294.","journal-title":"Naval Research Logistics"},{"key":"3014_CR22","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1057\/palgrave.jors.2602047","volume":"57","author":"T Drezner","year":"2006","unstructured":"Drezner, T., Drezner, Z., & Salhi, S. (2006). A multi objective heuristic approach for the casualty collection points location problem. Journal of the Operational Research Society, 57, 727\u2013734.","journal-title":"Journal of the Operational Research Society"},{"key":"3014_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56082-8","volume-title":"Facility location: Applications and theory","author":"Z Drezner","year":"2002","unstructured":"Drezner, Z., & Hamacher, H. (2002). Facility location: Applications and theory. New York: Springer."},{"key":"3014_CR24","volume-title":"Foundations of location analysis","year":"2011","unstructured":"Eiselt, H. A., & Marianov, V. (Eds.). (2011). Foundations of location analysis (Vol. 155). New York: Springer."},{"key":"3014_CR25","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.cie.2013.12.005","volume":"68","author":"RZ Farahani","year":"2014","unstructured":"Farahani, R. Z., Masoud Hekmatfar, M., Fahimnia, B., & Kazemzadeh, N. (2014). Hierarchical facility location problem: Models, classifications, techniques, and applications. Computers and Industrial Engineering, 68, 104\u2013117.","journal-title":"Computers and Industrial Engineering"},{"key":"3014_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-016-2360-8","author":"SL Gadegaard","year":"2016","unstructured":"Gadegaard, S. L., Klose, A., & Nielsen, L. R. (2016). A bi-objective approach to discrete cost-bottleneck location problems. Annals of Operations Research,. \n                    https:\/\/doi.org\/10.1007\/s10479-016-2360-8\n                    \n                  .","journal-title":"Annals of Operations Research"},{"key":"3014_CR27","first-page":"1233","volume":"51","author":"MDH Gamal","year":"2001","unstructured":"Gamal, M. D. H., & Salhi, S. (2001). Constructive heuristics for the uncapacitated location-allocation problem. Journal of the Operational Research Society, 51, 1233\u20131240.","journal-title":"Journal of the Operational Research Society"},{"key":"3014_CR28","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1016\/S0305-0548(02)00095-3","volume":"30","author":"MDH Gamal","year":"2003","unstructured":"Gamal, M. D. H., & Salhi, S. (2003). A cellular heuristic for the multisource weber problem. Computers and Operations Research, 30, 1609\u20131624.","journal-title":"Computers and Operations Research"},{"key":"3014_CR29","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/S0360-8352(97)00197-6","volume":"33","author":"D Gong","year":"1997","unstructured":"Gong, D., Gen, M., Yamazaki, G., & Xu, W. (1997). Hybrid evolutionary method for capacitated location-allocation problem. Computers and Industrial Engineering, 33, 577\u2013580.","journal-title":"Computers and Industrial Engineering"},{"key":"3014_CR30","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.ejor.2014.04.007","volume":"238","author":"G Guastaroba","year":"2014","unstructured":"Guastaroba, G., & Speranza, M. G. (2014). A heuristic for bilp problems: The single source capacitated facility location problem. European Journal of Operational Research, 238, 438\u2013450.","journal-title":"European Journal of Operational Research"},{"key":"3014_CR31","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1026110926707","volume":"123","author":"T Hale","year":"2003","unstructured":"Hale, T., & Moberg, C. (2003). Location science research: A review. Annals of Operations Research, 123, 21\u201335.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"3014_CR32","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P Hansen","year":"1997","unstructured":"Hansen, P., & Mladenovi\u0107, N. (1997). Variable neighbourhood search for the p-median. Location Science, 5(4), 207\u2013225.","journal-title":"Location Science"},{"issue":"3","key":"3014_CR33","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., & Mladenovi\u0107, N. (2001). Variable neighbourhood search: Principles and applications. European Journal of Operational Research, 130(3), 449\u2013467.","journal-title":"European Journal of Operational Research"},{"key":"3014_CR34","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0167-6377(98)00004-2","volume":"22","author":"P Hansen","year":"1998","unstructured":"Hansen, P., Mladenovi\u0107, N., & Taillard, E. D. (1998). Heuristic of the multisource weber problem as a p-median problem. Operation Research Letters, 22, 55\u201362.","journal-title":"Operation Research Letters"},{"issue":"1","key":"3014_CR35","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., & Perez, J. (2010). Variable neighbourhood search: Methods and applications. Annals of Operations Research, 175(1), 367\u2013407.","journal-title":"Annals of Operations Research"},{"key":"3014_CR36","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.asoc.2014.11.004","volume":"27","author":"SC Ho","year":"2015","unstructured":"Ho, S. C. (2015). An iterated Tabu search heuristic for the single source capacitated facility location problem. Applied Soft Computing, 27, 169\u2013178.","journal-title":"Applied Soft Computing"},{"key":"3014_CR37","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.cie.2015.01.013","volume":"83","author":"SJ Hosseininezhad","year":"2015","unstructured":"Hosseininezhad, S. J., Salhi, S., & Jabalameli, M. S. (2015). A cross entropy-based heuristic for the capacitated multi-source weber problem with facility fixed cost. Computers and Industrial Engineering, 83, 151\u2013158.","journal-title":"Computers and Industrial Engineering"},{"key":"3014_CR38","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ejor.2017.04.004","volume":"263","author":"CA Irawan","year":"2017","unstructured":"Irawan, C. A., Salhi, S., Luis, M., & Azizi, N. (2017). The continuous single source location problem with capacity and zone-dependent fixed cost: Models and solution approaches. European Journal of Operational Research, 263, 94\u2013107.","journal-title":"European Journal of Operational Research"},{"key":"3014_CR39","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.ejor.2003.10.031","volume":"162","author":"A Klose","year":"2005","unstructured":"Klose, A., & Drexl, A. (2005). Facility location models for distribution system design. European Journal of Operational Research, 162, 4\u201329.","journal-title":"European Journal of Operational Research"},{"key":"3014_CR40","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ijpe.2008.11.009","volume":"117","author":"CKY Lin","year":"2009","unstructured":"Lin, C. K. Y. (2009). Stochastic single-source capacitated facility location model with service level requirements. International Journal of Production Economics, 117, 439\u2013451.","journal-title":"International Journal of Production Economics"},{"key":"3014_CR41","doi-asserted-by":"publisher","first-page":"2007","DOI":"10.1016\/j.cor.2008.06.012","volume":"36","author":"M Luis","year":"2009","unstructured":"Luis, M., Salhi, S., & Nagy, G. (2009). Region-rejection based heuristics for the capacitated multi-source weber problem. Computers and Operations Research, 36, 2007\u20132017.","journal-title":"Computers and Operations Research"},{"key":"3014_CR42","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1016\/j.cor.2010.10.015","volume":"38","author":"M Luis","year":"2011","unstructured":"Luis, M., Salhi, S., & Nagy, G. (2011). A guided reactive grasp for the capacitated multi-source weber problem. Computers and Operations Research, 38, 1014\u20131024.","journal-title":"Computers and Operations Research"},{"key":"3014_CR43","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1260\/1748-3018.9.2.215","volume":"9","author":"M Luis","year":"2015","unstructured":"Luis, M., Salhi, S., & Nagy, G. (2015). A constructive method and a guided hybrid grasp for the capacitated multi-source weber problem in the presence of fixed cost. Journal of Algorithms and Computational Technology, 9, 215\u2013232.","journal-title":"Journal of Algorithms and Computational Technology"},{"key":"3014_CR44","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1016\/j.cor.2011.08.018","volume":"39","author":"SMH Manzour-al Ajdad","year":"2012","unstructured":"Manzour-al Ajdad, S. M. H., Torabi, S. A., & Eshghi, K. (2012). Single-source capacitated multi-facility weber problem\u2014An iterative two phase heuristic algorithm. Computers and Operations Research, 39, 1465\u20131476.","journal-title":"Computers and Operations Research"},{"key":"3014_CR45","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1007\/s00170-013-5114-7","volume":"69","author":"H Manzour","year":"2013","unstructured":"Manzour, H., Torabi, A., & Pishvaee, M. S. (2013). New heuristic methods for the single-source capacitated multi facility weber problem. International Journal of Advanced Manufacturing Technology, 69, 1569\u20131579.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"3014_CR46","doi-asserted-by":"publisher","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":"3014_CR47","first-page":"514","volume":"3","author":"N Mohammadi","year":"2010","unstructured":"Mohammadi, N., Malek, M. R., & Alesheikh, A. A. (2010). A new GA based solution for capacitated multi source weber problem. International Journal of Computational Intelligence Systems, 3, 514\u2013521.","journal-title":"International Journal of Computational Intelligence Systems"},{"key":"3014_CR48","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1016\/j.cie.2013.01.005","volume":"64","author":"T \u00d6ncan","year":"2013","unstructured":"\u00d6ncan, T. (2013). Heuristics for the single source capacitated multi-facility weber problem. Computers and Industrial Engineering, 64, 959\u2013971.","journal-title":"Computers and Industrial Engineering"},{"key":"3014_CR49","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ins.2014.06.002","volume":"283","author":"A Rahmani","year":"2014","unstructured":"Rahmani, A., & MirHassani, S. A. (2014). A hybrid firefly-genetic algorithm for the capacitated facility location problem. Information Sciences, 283, 70\u201378.","journal-title":"Information Sciences"},{"key":"3014_CR50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49355-8","volume-title":"Heuristic search: The emerging science of problem solving","author":"S Salhi","year":"2017","unstructured":"Salhi, S. (2017). Heuristic search: The emerging science of problem solving. Basel: Springer."},{"key":"3014_CR51","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10479-007-0223-z","volume":"167","author":"S Salhi","year":"2009","unstructured":"Salhi, S., & Nagy, G. (2009). Local improvement in planar facility location using vehicle routing. Annals of Operations Research, 167, 287\u2013296.","journal-title":"Annals of Operations Research"},{"key":"3014_CR52","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1287\/moor.13.1.32","volume":"13","author":"HD Sherali","year":"1988","unstructured":"Sherali, H. D., & Nordai, F. L. (1988). Np-hard, capacitated, balanced p-median problems on a chain graph with a continuum of link demands. Mathematics of Operations Research, 13, 32\u201349.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"3014_CR53","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.ejor.2012.03.047","volume":"221","author":"Z Yang","year":"2012","unstructured":"Yang, Z., Chu, F., & Chen, H. (2012). A cut-and-solve based algorithm for the single source capacitated facility location problem. European Journal of Operational Research, 221(3), 521\u2013532.","journal-title":"European Journal of Operational Research"},{"key":"3014_CR54","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1016\/j.ejor.2005.09.050","volume":"179","author":"ZM Zainuddin","year":"2007","unstructured":"Zainuddin, Z. M., & Salhi, S. (2007). A perturbation-based heuristic for the capacitated multisource weber problem. European Journal of Operational Research, 179, 1194\u20131207.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3014-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-3014-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3014-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T23:21:16Z","timestamp":1566516076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-3014-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,23]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["3014"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-3014-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,23]]},"assertion":[{"value":"23 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}