{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:26Z","timestamp":1740107846572,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T00:00:00Z","timestamp":1538697600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["18-07-01037"],"award-info":[{"award-number":["18-07-01037"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s00500-018-3562-6","type":"journal-article","created":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T21:45:37Z","timestamp":1538689537000},"page":"2959-2967","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An effective heuristic for large-scale fault-tolerant k-median problem"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1862-4586","authenticated-orcid":false,"given":"Igor","family":"Vasilyev","sequence":"first","affiliation":[]},{"given":"Anton V.","family":"Ushakov","sequence":"additional","affiliation":[]},{"given":"Nadezhda","family":"Maltugueva","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Sforza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,5]]},"reference":[{"issue":"4","key":"3562_CR1","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1287\/ijoc.1120.0534","volume":"25","author":"R Aboolian","year":"2013","unstructured":"Aboolian R, Cui T, Shen ZJM (2013) An efficient approach for solving reliable facility location models. INFORMS J Comput 25(4):720\u2013729. \n                    https:\/\/doi.org\/10.1287\/ijoc.1120.0534","journal-title":"INFORMS J Comput"},{"issue":"3","key":"3562_CR2","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1016\/j.ejor.2015.03.049","volume":"245","author":"M Albareda-Sambola","year":"2015","unstructured":"Albareda-Sambola M, Hinojosa Y, Puerto J (2015) The reliable \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -median problem with at-facility service. Eur J Oper Res 245(3):656\u2013666","journal-title":"Eur J Oper Res"},{"issue":"1","key":"3562_CR3","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ejor.2012.04.016","volume":"222","author":"J Alcaraz","year":"2012","unstructured":"Alcaraz J, Landete M, Monge JF (2012) Design and analysis of hybrid metaheuristics for the reliability \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -median problem. Eur J Oper Res 222(1):54\u201364. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2012.04.016","journal-title":"Eur J Oper Res"},{"issue":"1","key":"3562_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1287\/moor.1090.0428","volume":"35","author":"B Anthony","year":"2010","unstructured":"Anthony B, Goyal V, Gupta A, Nagarajan V (2010) A plant location guide for the unsure: approximation algorithms for min\u2013max location problems. Math Oper Res 35(1):79\u2013101. \n                    https:\/\/doi.org\/10.1287\/moor.1090.0428","journal-title":"Math Oper Res"},{"key":"3562_CR5","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1023\/A:1018990331754","volume":"86","author":"P Avella","year":"1999","unstructured":"Avella P, Sforza A (1999) Logical reduction tests for the \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -problem. Ann Oper Res 86:105\u2013115","journal-title":"Ann Oper Res"},{"issue":"1","key":"3562_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10107-005-0700-6","volume":"109","author":"P Avella","year":"2007","unstructured":"Avella P, Sassano A, Vasilyev I (2007) Computational study of large-scale \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -median problems. Math Program 109(1):89\u2013114","journal-title":"Math Program"},{"issue":"6","key":"3562_CR7","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10732-008-9078-y","volume":"15","author":"P Avella","year":"2008","unstructured":"Avella P, Boccia M, Sforza A, Vasilyev I (2008) An effective heuristic for large-scale capacitated facility location problems. J Heuristics 15(6):597\u2013615","journal-title":"J Heuristics"},{"issue":"7","key":"3562_CR8","doi-asserted-by":"publisher","first-page":"1625","DOI":"10.1016\/j.cor.2011.09.016","volume":"39","author":"P Avella","year":"2012","unstructured":"Avella P, Boccia M, Salerno S, Vasilyev I (2012) An aggregation heuristic for large scale \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -median problem. Comput Oper Res 39(7):1625\u20131632","journal-title":"Comput Oper Res"},{"issue":"3","key":"3562_CR9","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0377-2217(93)90118-7","volume":"65","author":"JE Beasley","year":"1993","unstructured":"Beasley JE (1993) Lagrangean heuristics for location problems. Eur J Oper Res 65(3):383\u2013399","journal-title":"Eur J Oper Res"},{"issue":"2","key":"3562_CR10","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1287\/opre.1060.0348","volume":"55","author":"O Berman","year":"2007","unstructured":"Berman O, Krass D, Menezes MBC (2007) Facility reliability issues in network \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -median problems: strategic centralization and co-location effects. Oper Res 55(2):332\u2013350. \n                    https:\/\/doi.org\/10.1287\/opre.1060.0348","journal-title":"Oper Res"},{"issue":"4","key":"3562_CR11","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1111\/j.1540-5915.2009.00253.x","volume":"40","author":"O Berman","year":"2009","unstructured":"Berman O, Krass D, Menezes MBC (2009) Locating facilities in the presence of disruptions and incomplete information. Decis Sci 40(4):845\u2013868. \n                    https:\/\/doi.org\/10.1111\/j.1540-5915.2009.00253.x","journal-title":"Decis Sci"},{"key":"3562_CR12","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-08404-6_5","volume-title":"Algorithm theory\u2014SWAT 2014: 14th Scandinavian symposium and workshops, Copenhagen, Denmark, July 2\u20134, 2014. Proceedings","author":"S Bhattacharya","year":"2014","unstructured":"Bhattacharya S, Chalermsook P, Mehlhorn K, Neumann A (2014) New approximability results for the robust \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -median problem. In: Ravi R, G\u00f8rtz IL (eds) Algorithm theory\u2014SWAT 2014: 14th Scandinavian symposium and workshops, Copenhagen, Denmark, July 2\u20134, 2014. Proceedings. Springer, Cham, pp 50\u201361. \n                    https:\/\/doi.org\/10.1007\/978-3-319-08404-6_5"},{"key":"3562_CR13","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-13036-6_19","volume-title":"Integer programming and combinatorial optimization: 14th international conference, IPCO 2010, Lausanne, Switzerland, June 9\u201311, 2010. Proceedings","author":"J Byrka","year":"2010","unstructured":"Byrka J, Srinivasan A, Swamy C (2010) Fault-tolerant facility location: a randomized dependent lp-rounding algorithm. In: Eisenbrand F, Shepherd FB (eds) Integer programming and combinatorial optimization: 14th international conference, IPCO 2010, Lausanne, Switzerland, June 9\u201311, 2010. Proceedings. Springer, Berlin, pp 244\u2013257. \n                    https:\/\/doi.org\/10.1007\/978-3-642-13036-6_19"},{"issue":"5","key":"3562_CR14","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A Caprara","year":"1999","unstructured":"Caprara A, Fischetti M, Toth P (1999) A heuristic method for the set covering problem. Oper Res 47(5):730\u2013743","journal-title":"Oper Res"},{"issue":"11","key":"3562_CR15","doi-asserted-by":"publisher","first-page":"2625","DOI":"10.1016\/j.cor.2012.01.009","volume":"39","author":"E Carrizosa","year":"2012","unstructured":"Carrizosa E, Ushakov A, Vasilyev I (2012) A computational study of a nonlinear minsum facility location problem. Comput Oper Res 39(11):2625\u20132633","journal-title":"Comput Oper Res"},{"issue":"Supplement C","key":"3562_CR16","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.tcs.2014.05.013","volume":"543","author":"S Chechik","year":"2014","unstructured":"Chechik S, Peleg D (2014) Robust fault tolerant uncapacitated facility location. Theor Comput Sci 543(Supplement C):9\u201323. \n                    https:\/\/doi.org\/10.1016\/j.tcs.2014.05.013","journal-title":"Theor Comput Sci"},{"issue":"4\u2013part\u20131","key":"3562_CR17","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1287\/opre.1090.0801","volume":"58","author":"T Cui","year":"2010","unstructured":"Cui T, Ouyang Y, Shen ZJM (2010) Reliable facility location design under the risk of disruptions. Oper Res 58(4\u2013part\u20131):998\u20131011. \n                    https:\/\/doi.org\/10.1287\/opre.1090.0801","journal-title":"Oper Res"},{"key":"3562_CR18","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1137\/1.9781611973730.97","volume-title":"Proceedings the 26th annual ACM-SIAM symposium on discrete algorithms, SODA\u201915","author":"H Ding","year":"2015","unstructured":"Ding H, Xu J (2015) A unified framework for clustering constrained data without locality property. In: Indyk P (ed) Proceedings the 26th annual ACM-SIAM symposium on discrete algorithms, SODA\u201915. SIAM, Philadelphia, pp 1471\u20131490. \n                    https:\/\/doi.org\/10.1137\/1.9781611973730.97"},{"issue":"6","key":"3562_CR19","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1057\/jors.1987.88","volume":"38","author":"Z Drezner","year":"1987","unstructured":"Drezner Z (1987) Heuristic solution methods for two location problems with unreliable facilities. J Oper Res Soc 38(6):509\u2013514. \n                    https:\/\/doi.org\/10.1057\/jors.1987.88","journal-title":"J Oper Res Soc"},{"issue":"1","key":"3562_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"ML Fisher","year":"1981","unstructured":"Fisher ML (1981) The lagrangian relaxation method for solving integer programming problems. Manag Sci 27(1):1\u201318","journal-title":"Manag Sci"},{"issue":"4","key":"3562_CR21","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1287\/ijoc.1100.0418","volume":"23","author":"S Garc\u00eda","year":"2011","unstructured":"Garc\u00eda S, Labb\u00e9 M, Mar\u00edn A (2011) Solving large \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -median problems with a radius formulation. INFORMS J Comput 23(4):546\u2013556","journal-title":"INFORMS J Comput"},{"key":"3562_CR22","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BFb0120690","volume-title":"Approaches to integer programming, mathematical programming studies","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion AM (1974) Lagrangean relaxation for integer programming. In: Balinski ML (ed) Approaches to integer programming, mathematical programming studies, vol 2. Springer, Berlin, pp 82\u2013114"},{"key":"3562_CR23","doi-asserted-by":"publisher","unstructured":"Gomes T, Tapolcai J, Esposito C, Hutchison D, Kuipers F, Rak J, de Sousa A, Iossifides A, Travanca R, Andr\u00e9 J, Jorge L, Martins L, Ugalde PO, Pa\u0161i\u0107 A, Pezaros D, Jouet S, Secci S, Tornatore M (2016) A survey of strategies for communication networks to protect against large-scale natural disasters. In: Proceedings of 8th international workshop on resilient networks design and modeling (RNDM). Gda\u0144sk University of Technology, Gda\u0144sk, pp 11\u201322. \n                    https:\/\/doi.org\/10.1109\/RNDM.2016.7608263","DOI":"10.1109\/RNDM.2016.7608263"},{"issue":"1","key":"3562_CR24","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.ejor.2017.04.009","volume":"263","author":"K Govindan","year":"2017","unstructured":"Govindan K, Fattahi M, Keyvanshokooh E (2017) Supply chain network design under uncertainty: a comprehensive review and future research directions. Eur J Oper Res 263(1):108\u2013141. \n                    https:\/\/doi.org\/10.1016\/j.ejor.2017.04.009","journal-title":"Eur J Oper Res"},{"issue":"2","key":"3562_CR25","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/S0196-6774(03)00056-7","volume":"48","author":"S Guha","year":"2003","unstructured":"Guha S, Meyerson A, Munagala K (2003) A constant factor approximation algorithm for the fault-tolerant facility location problem. J Algorithms 48(2):429\u2013440. \n                    https:\/\/doi.org\/10.1016\/S0196-6774(03)00056-7","journal-title":"J Algorithms"},{"issue":"3","key":"3562_CR26","doi-asserted-by":"publisher","first-page":"36:1","DOI":"10.1145\/2854153","volume":"12","author":"M Hajiaghayi","year":"2016","unstructured":"Hajiaghayi M, Hu W, Li J, Li S, Saha B (2016) A constant factor approximation algorithm for fault-tolerant \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -median. ACM Trans Algorithms 12(3):36:1\u201336:19. \n                    https:\/\/doi.org\/10.1145\/2854153","journal-title":"ACM Trans Algorithms"},{"issue":"3","key":"3562_CR27","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1287\/opre.13.3.462","volume":"13","author":"SL Hakimi","year":"1965","unstructured":"Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13(3):462\u2013475","journal-title":"Oper Res"},{"issue":"3","key":"3562_CR28","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10618-009-0135-4","volume":"19","author":"P Hansen","year":"2009","unstructured":"Hansen P, Brimberg J, Urosevi\u0107 D, Mladenovi\u0107 N (2009) Solving large \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -median clustering problems by primal-dual variable neighborhood search. Data Min Knowl Discov 19(3):351\u2013375","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"3562_CR29","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1016\/j.ejor.2014.01.050","volume":"237","author":"CA Irawan","year":"2014","unstructured":"Irawan CA, Salhi S, Scaparra MP (2014) An adaptive multiphase approach for large unconditional and conditional p-median problems. Eur J Oper Res 237(2):590\u2013605","journal-title":"Eur J Oper Res"},{"issue":"2","key":"3562_CR30","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain K, Vazirani VV (2001) Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J ACM 48(2):274\u2013296","journal-title":"J ACM"},{"issue":"3","key":"3562_CR31","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s00453-003-1070-1","volume":"38","author":"K Jain","year":"2004","unstructured":"Jain K, Vazirani VV (2004) An approximation algorithm for the fault tolerant metric facility location problem. Algorithmica 38(3):433\u2013439. \n                    https:\/\/doi.org\/10.1007\/s00453-003-1070-1","journal-title":"Algorithmica"},{"issue":"3","key":"3562_CR32","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi S (1979) An algorithmic approach to network location problems. ii: the \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -medians. SIAM J Appl Math 37(3):539\u2013560","journal-title":"SIAM J Appl Math"},{"issue":"4","key":"3562_CR33","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/j.cor.2012.11.012","volume":"40","author":"Q Li","year":"2013","unstructured":"Li Q, Zeng B, Savachkin A (2013) Reliable facility location design under disruptions. Comput Oper Res 40(4):901\u2013909. \n                    https:\/\/doi.org\/10.1016\/j.cor.2012.11.012","journal-title":"Comput Oper Res"},{"issue":"1","key":"3562_CR34","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1002\/nav.20385","volume":"57","author":"M Lim","year":"2010","unstructured":"Lim M, Daskin M, Bassamboo A, Chopra S (2010) A facility reliability problem: formulation, properties, and algorithm. Nav Res Logist 57(1):58\u201370. \n                    https:\/\/doi.org\/10.1002\/nav.20385","journal-title":"Nav Res Logist"},{"issue":"4","key":"3562_CR35","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/msom.2015.0541","volume":"17","author":"M Lu","year":"2015","unstructured":"Lu M, Ran L, Shen ZJM (2015) Reliable facility location design under uncertain correlated disruptions. Manuf Serv Oper Manag 17(4):445\u2013455. \n                    https:\/\/doi.org\/10.1287\/msom.2015.0541","journal-title":"Manuf Serv Oper Manag"},{"key":"3562_CR36","doi-asserted-by":"publisher","DOI":"10.1002\/net.21821","author":"A Masone","year":"2018","unstructured":"Masone A, Sterle C, Vasilyev I, Ushakov A (2018) A three-stage p-median based exact method for the optimal diversity management problem. Networks. \n                    https:\/\/doi.org\/10.1002\/net.21821","journal-title":"Networks"},{"issue":"4","key":"3562_CR37","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1287\/mnsc.25.4.329","volume":"25","author":"JM Mulvey","year":"1979","unstructured":"Mulvey JM, Crowder HP (1979) Cluster analysis: an application of lagrangian relaxation. Manag Sci 25(4):329\u2013340","journal-title":"Manag Sci"},{"key":"3562_CR38","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-319-18263-6_6","volume-title":"Approximation and online algorithms: 12th international workshop, WAOA 2014, Wroc\u0142aw, Poland, Sept 11\u201312, 2014, Revised selected papers","author":"B Rybicki","year":"2015","unstructured":"Rybicki B, Byrka J (2015) Improved approximation algorithm for fault-tolerant facility placement. In: Bampis E, Svensson O (eds) Approximation and online algorithms: 12th international workshop, WAOA 2014, Wroc\u0142aw, Poland, Sept 11\u201312, 2014, Revised selected papers. Springer, Cham, pp 59\u201370. \n                    https:\/\/doi.org\/10.1007\/978-3-319-18263-6_6"},{"issue":"3","key":"3562_CR39","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1287\/trsc.1040.0107","volume":"39","author":"LV Snyder","year":"2005","unstructured":"Snyder LV, Daskin MS (2005) Reliability models for facility location: the expected failure cost case. Transp Sci 39(3):400\u2013416","journal-title":"Transp Sci"},{"issue":"2","key":"3562_CR40","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1080\/0740817X.2015.1067735","volume":"48","author":"LV Snyder","year":"2016","unstructured":"Snyder LV, Atan Z, Peng P, Rong Y, Schmitt AJ, Sinsoysal B (2016) Or\/ms models for supply chain disruptions: a review. IIE Trans 48(2):89\u2013109. \n                    https:\/\/doi.org\/10.1080\/0740817X.2015.1067735","journal-title":"IIE Trans"},{"issue":"4","key":"3562_CR41","doi-asserted-by":"publisher","first-page":"51:1","DOI":"10.1145\/1383369.1383382","volume":"4","author":"C Swamy","year":"2008","unstructured":"Swamy C, Shmoys DB (2008) Fault-tolerant facility location. ACM Trans Algorithms 4(4):51:1\u201351:27. \n                    https:\/\/doi.org\/10.1145\/1383369.1383382","journal-title":"ACM Trans Algorithms"},{"key":"3562_CR42","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-319-67308-0-30","volume-title":"Optimization and decision science: methodologies and applications: ODS, Sorrento, Italy, Sept 4\u20137, 2017","author":"I Vasilyev","year":"2017","unstructured":"Vasilyev I, Ushakov A (2017) A shared memory parallel heuristic algorithm for the large-scale \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  -median problem. In: Sforza A, Sterle C (eds) Optimization and decision science: methodologies and applications: ODS, Sorrento, Italy, Sept 4\u20137, 2017. Springer, Cham, pp 295\u2013302. \n                    https:\/\/doi.org\/10.1007\/978-3-319-67308-0-30"},{"issue":"Supplement C","key":"3562_CR43","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jda.2015.03.004","volume":"33","author":"L Yan","year":"2015","unstructured":"Yan L, Chrobak M (2015) Lp-rounding algorithms for the fault-tolerant facility placement problem. J Discrete Algorithms 33(Supplement C):93\u2013114. \n                    https:\/\/doi.org\/10.1016\/j.jda.2015.03.004","journal-title":"J Discrete Algorithms"},{"issue":"Supplement C","key":"3562_CR44","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.trb.2017.06.014","volume":"104","author":"G Yu","year":"2017","unstructured":"Yu G, Haskell WB, Liu Y (2017) Resilient facility location against the risk of disruptions. Transp Res B Methodol 104(Supplement C):82\u2013105. \n                    https:\/\/doi.org\/10.1016\/j.trb.2017.06.014","journal-title":"Transp Res B Methodol"},{"issue":"Part 2","key":"3562_CR45","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1016\/j.trb.2014.10.010","volume":"81","author":"L Yun","year":"2015","unstructured":"Yun L, Qin Y, Fan H, Ji C, Li X, Jia L (2015) A reliability model for facility location design under imperfect information. Transp Res B Methodol 81(Part 2):596\u2013615. \n                    https:\/\/doi.org\/10.1016\/j.trb.2014.10.010","journal-title":"Transp Res B Methodol"},{"issue":"Supplement C","key":"3562_CR46","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.trb.2015.11.009","volume":"83","author":"Y Zhang","year":"2016","unstructured":"Zhang Y, Snyder LV, Qi M, Miao L (2016) A heterogeneous reliable location model with risk pooling under supply disruptions. Transp Res B Methodol 83(Supplement C):151\u2013178. \n                    https:\/\/doi.org\/10.1016\/j.trb.2015.11.009","journal-title":"Transp Res B Methodol"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3562-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3562-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3562-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T19:19:09Z","timestamp":1570216749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3562-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,5]]},"references-count":46,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["3562"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3562-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2018,10,5]]},"assertion":[{"value":"5 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"All the authors (I. Vasilyev, A. V. Ushakov, N. Maltugueva and A. Sfroza) declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}