{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T10:52:54Z","timestamp":1774435974683,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,4,24]],"date-time":"2015-04-24T00:00:00Z","timestamp":1429833600000},"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":["Optim Lett"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s11590-015-0892-5","type":"journal-article","created":{"date-parts":[[2015,4,23]],"date-time":"2015-04-23T01:26:08Z","timestamp":1429752368000},"page":"1297-1314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Threshold robustness in discrete facility location problems: a bi-objective approach"],"prefix":"10.1007","volume":"9","author":[{"given":"Emilio","family":"Carrizosa","sequence":"first","affiliation":[]},{"given":"Anton","family":"Ushakov","sequence":"additional","affiliation":[]},{"given":"Igor","family":"Vasilyev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,24]]},"reference":[{"issue":"3","key":"892_CR1","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1016\/j.ejor.2006.12.063","volume":"191","author":"E Alekseeva","year":"2008","unstructured":"Alekseeva, E., Kochetov, Y., Plyasunov, A.: Complexity of local search for the p-median problem. Eur. J. Oper. Res. 191(3), 736\u2013752 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"892_CR2","doi-asserted-by":"crossref","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.: An aggregation heuristic for large scale p-median problem. Comput. Oper. Res. 39(7), 1625\u20131632 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"892_CR3","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10107-005-0700-6","volume":"109","author":"P Avella","year":"2007","unstructured":"Avella, P., Sassano, A., Vasilyev, I.: Computational study of large-scale p-median problems. Math. Program. 109(1), 89\u2013114 (2007)","journal-title":"Math. Program."},{"issue":"4","key":"892_CR4","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23(4), 769\u2013805 (1998)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"892_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1), 1\u201313 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20133","key":"892_CR6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. 98(1\u20133), 49\u201371 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"892_CR7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"892_CR8","doi-asserted-by":"crossref","unstructured":"Bilde, O., Krarup, J.: Sharp lower bounds and efficient algorithms for the simple plant location problem. In: Hammer, P.L., Johnson, E.L., Korte, B.H., Nemhauser, G.L. (eds.) Studies in Integer Programming, Annals of Discrete Mathematics, vol. 1, pp. 79\u201397. Elsevier, Amsterdam (1977)","DOI":"10.1016\/S0167-5060(08)70728-3"},{"issue":"2","key":"892_CR9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1015579208736","volume":"23","author":"R Blanquero","year":"2002","unstructured":"Blanquero, R., Carrizosa, E.: A d.c. biojective location model. J. Glob. Optim. 23(2), 139\u2013154 (2002)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"892_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.ejor.2011.05.040","volume":"215","author":"R Blanquero","year":"2011","unstructured":"Blanquero, R., Carrizosa, E., Hendrix, E.M.T.: Locating a competitive facility in the plane with a robustness criterion. Eur. J. Oper. Res. 215(1), 21\u201324 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"892_CR11","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s001860300294","volume":"58","author":"E Carrizosa","year":"2003","unstructured":"Carrizosa, E., Nickel, S.: Robust facility location. Math. Methods Oper. Res. 58(2), 331\u2013349 (2003)","journal-title":"Math. Methods Oper. Res."},{"key":"892_CR12","doi-asserted-by":"crossref","unstructured":"Chudak, F.: Improved approximation algorithms for uncapacitated facility location. In: Bixby, R.E., Boyd, E.A., Ros-Mercado, R.Z. (eds.) Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 1412, pp. 180\u2013194. Springer, Berlin (1998)","DOI":"10.1007\/3-540-69346-7_14"},{"issue":"1","key":"892_CR13","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s11750-012-0257-5","volume":"22","author":"M Ciligot-Travain","year":"2014","unstructured":"Ciligot-Travain, M., Traor\u00e9, S.: On a robustness property in single-facility location in continuous space. TOP 22(1), 321\u2013330 (2014)","journal-title":"TOP"},{"key":"892_CR14","volume-title":"Multiobjective Programming and Planning, Mathematics in Science and Engineering","author":"JL Cohon","year":"1978","unstructured":"Cohon, J.L.: Multiobjective Programming and Planning, Mathematics in Science and Engineering, vol. 140. Academic Press, New York (1978)"},{"key":"892_CR15","doi-asserted-by":"crossref","unstructured":"Correia, I., Saldanha da Gama, F.: Facility location under uncertainty. In: Laporte, G., Nickel, G., Saldanha da Gama, F. (eds.) Location Science, pp. 177\u2013203. Springer International Publishing, Berlin (2015)","DOI":"10.1007\/978-3-319-13111-5_8"},{"key":"892_CR16","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032343","volume-title":"Network and Discrete Location: Models, Algorithms, and Applications","author":"M Daskin","year":"1995","unstructured":"Daskin, M.: Network and Discrete Location: Models, Algorithms, and Applications. Wiley, New York (1995)"},{"key":"892_CR17","doi-asserted-by":"crossref","unstructured":"Daskin, M.S., Maass, K.L.: The p-median problem. In: Laporte, G., Nickel, S., Saldanha da Gama, F. (eds.) Location Science, pp. 21\u201345. Springer International Publishing, Berlin (2015)","DOI":"10.1007\/978-3-319-13111-5_2"},{"key":"892_CR18","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Berlin (2005)"},{"key":"892_CR19","doi-asserted-by":"crossref","unstructured":"Ehrgott, M., Gandibleux, X. (eds.): Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys, chap. Multiobjective Combinatorial Optimization, pp. 369\u2013407. International Series in Operations Research & Management Science. Kluwer Academic Publishers, Dordrecht (2002)","DOI":"10.1007\/b101915"},{"key":"892_CR20","doi-asserted-by":"crossref","unstructured":"Ehrgott, M., Gandibleux, X. (eds.): Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys. International Series in Operations Research & Management Science. Kluwer Academic Publishers (2002)","DOI":"10.1007\/b101915"},{"key":"892_CR21","unstructured":"Ehrgott, M., Ryan, D.: Bicriteria robustness versus cost optimisation in tour of duty planning at air new zealand. In: Proceedings of the 35th Annual Conference of the Operational Research Society of New Zealand, pp. 31\u201339. ORSNZ, Auckland (2000)"},{"issue":"7","key":"892_CR22","doi-asserted-by":"crossref","first-page":"1689","DOI":"10.1016\/j.apm.2009.10.005","volume":"34","author":"RZ Farahani","year":"2010","unstructured":"Farahani, R.Z., SteadieSeifi, M., Asgari, N.: Multiple criteria facility location problems: a survey. Appl. Math. Model. 34(7), 1689\u20131709 (2010)","journal-title":"Appl. Math. Model."},{"issue":"10","key":"892_CR23","doi-asserted-by":"crossref","first-page":"2418","DOI":"10.1016\/j.cor.2013.02.011","volume":"40","author":"C Filippi","year":"2013","unstructured":"Filippi, C., Stevenato, E.: Approximation schemes for bi-objective combinatorial optimization and their application to the tsp with profits. Comput. Oper. Res. 40(10), 2418\u20132428 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"892_CR24","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.ejor.2013.09.036","volume":"235","author":"V Gabrel","year":"2014","unstructured":"Gabrel, V., Murat, C., Thiele, A.: Recent advances in robust optimization: An overview. Eur. J. Oper. Res. 235(3), 471\u2013483 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"892_CR25","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"S Hakimi","year":"1964","unstructured":"Hakimi, S.: Optimal location of switching centers and the absolute centers and medians of a graph. Oper. Res. 12(3), 450\u2013459 (1964)","journal-title":"Oper. Res."},{"issue":"3","key":"892_CR26","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/opre.13.3.462","volume":"13","author":"S Hakimi","year":"1965","unstructured":"Hakimi, S.: Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper. Res. 13(3), 462\u2013475 (1965)","journal-title":"Oper. Res."},{"key":"892_CR27","unstructured":"Handler, G.Y., Mirchandani, P.B.: Location on Networks: Theory and Algorithms, chap. Multiobjective and Other Location Problems on Network, pp. 165\u2013195. MIT Press, Cambridge (1979)"},{"issue":"9\u201310","key":"892_CR28","doi-asserted-by":"crossref","first-page":"2630","DOI":"10.1016\/j.apm.2013.11.002","volume":"38","author":"SM Hatefi","year":"2014","unstructured":"Hatefi, S.M., Jolai, F.: Robust and reliable forwardreverse logistics network design under demand uncertainty and facility disruptions. Appl. Math. Model. 38(9\u201310), 2630\u20132647 (2014)","journal-title":"Appl. Math. Model."},{"issue":"3","key":"892_CR29","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.ejor.2014.01.003","volume":"235","author":"J Kalcsics","year":"2014","unstructured":"Kalcsics, J., Nickel, S., Pozo, M.A., Puerto, J., Rodrguez-Cha, A.M.: The multicriteria p-facility median location problem on networks. Eur. J. Oper. Res. 235(3), 484\u2013493 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"892_CR30","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.: An algorithmic approach to network location problems; part 2. the $$p$$ p -medians. SIAM J. Appl. Math. 37(3), 539\u2013560 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"892_CR31","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/0-387-25383-1_16","volume-title":"Metaheuristics: Progress as Real Problem Solvers","author":"Y Kochetov","year":"2005","unstructured":"Kochetov, Y., Ivanenko, D.: Computationally difficult instances for the uncapacitated facility location problem. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp. 351\u2013367. Springer, New York (2005)"},{"issue":"2","key":"892_CR32","first-page":"105","volume":"12","author":"AA Kolokolov","year":"2013","unstructured":"Kolokolov, A.A., Zaozerskaya, L.A.: Solving a bicriteria problem of optimal service centers location. JMMA 12(2), 105\u2013116 (2013)","journal-title":"JMMA"},{"issue":"2","key":"892_CR33","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0377-2217(89)90189-6","volume":"39","author":"M K\u00f6rkel","year":"1989","unstructured":"K\u00f6rkel, M.: On the exact solution of large-scale simple plant location problems. Eur. J. Oper. Res. 39(2), 157\u2013173 (1989)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"892_CR34","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","volume":"12","author":"J Krarup","year":"1983","unstructured":"Krarup, J., Pruzan, P.M.: The simple plant location problem: survey and synthesis. Eur. J. Oper. Res. 12(1), 36\u201381 (1983)","journal-title":"Eur. J. Oper. Res."},{"key":"892_CR35","first-page":"551","volume-title":"Network Routing, Handbooks in Operations Research and Management Science","author":"M Labb\u00e9","year":"1995","unstructured":"Labb\u00e9, M., Peeters, D., Thisse, J.F.: Location on networks. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing, Handbooks in Operations Research and Management Science, vol. 8, pp. 551\u2013624. Elsevier, Amsterdam (1995)"},{"issue":"3","key":"892_CR36","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.ejor.2013.10.020","volume":"234","author":"AN Letchford","year":"2014","unstructured":"Letchford, A.N., Miller, S.J.: An aggressive reduction scheme for the simple plant location problem. Eur. J. Oper. Res. 234(3), 674\u2013682 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"892_CR37","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1287\/mnsc.11.2.213","volume":"11","author":"AS Manne","year":"1964","unstructured":"Manne, A.S.: Plant location under economies-of-scale\u2014decentralization and computation. Manage. Sci. 11(2), 213\u2013235 (1964)","journal-title":"Manage. Sci."},{"issue":"2","key":"892_CR38","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.amc.2009.03.037","volume":"213","author":"G Mavrotas","year":"2009","unstructured":"Mavrotas, G.: Effective implementation of the $$\\varepsilon $$ \u03b5 -constraint method in multi-objective mathematical programming problems. Appl. Math. Comput. 213(2), 455\u2013465 (2009)","journal-title":"Appl. Math. Comput."},{"key":"892_CR39","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.omega.2014.11.005","volume":"52","author":"G Mavrotas","year":"2015","unstructured":"Mavrotas, G., Figueira, J.R., Siskos, E.: Robustness analysis methodology for multi-objective combinatorial optimization problems and application to project selection. Omega 52, 142\u2013155 (2015)","journal-title":"Omega"},{"issue":"10","key":"892_CR40","first-page":"1341","volume":"36","author":"I Melamed","year":"1996","unstructured":"Melamed, I., Sigal, I.: A computational investigation of linear parametrization of criteria in multicriteria discrete programming. Comput. Math. Phys. 36(10), 1341\u20131343 (1996)","journal-title":"Comput. Math. Phys."},{"issue":"8","key":"892_CR41","first-page":"902","volume":"37","author":"I Melamed","year":"1997","unstructured":"Melamed, I., Sigal, I.: The linear convolution of criteria in the bicriteria traveling salesman problem. Comput. Math. Phys. 37(8), 902\u2013905 (1997)","journal-title":"Comput. Math. Phys."},{"issue":"10","key":"892_CR42","first-page":"1704","volume":"38","author":"I Melamed","year":"1998","unstructured":"Melamed, I., Sigal, I.: Numerical analysis of tricriteria tree and assignment problems. Comput. Math. Phys. 38(10), 1704\u20131707 (1998)","journal-title":"Comput. Math. Phys."},{"issue":"3","key":"892_CR43","first-page":"490","volume":"59","author":"I Melamed","year":"1999","unstructured":"Melamed, I., Sigal, I.: Combinatorial optimization problems with two and three criteria. Dokl. Math. 59(3), 490\u2013493 (1999)","journal-title":"Dokl. Math."},{"key":"892_CR44","unstructured":"Mirchandani, P., Francis, R. (eds.): Discrete Location Theory. Wiley, New York (1990)"},{"issue":"3","key":"892_CR45","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N Mladenovi\u0107","year":"2007","unstructured":"Mladenovi\u0107, N., Brimberg, J., Hansen, P., Moreno-P\u00e9rez, J.: The $$p$$ p -median problem: a survey of metaheuristic approaches. Eur. J. Oper. Res. 179(3), 927\u2013939 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"892_CR46","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/opre.43.2.264","volume":"43","author":"JM Mulvey","year":"1995","unstructured":"Mulvey, J.M., Vanderbei, R.J., Zenios, S.A.: Robust optimization of large-scale systems. Oper. Res. 43(2), 264\u2013281 (1995)","journal-title":"Oper. Res."},{"issue":"11\u201312","key":"892_CR47","doi-asserted-by":"crossref","first-page":"1804","DOI":"10.1016\/j.mcm.2013.03.009","volume":"58","author":"J Razmi","year":"2013","unstructured":"Razmi, J., Zahedi-Anaraki, A.H., Zakerinia, M.S.: A bi-objective stochastic optimization model for reliable warehouse network redesign. Math. Comput. Model. 58(11\u201312), 1804\u20131813 (2013)","journal-title":"Math. Comput. Model."},{"issue":"3","key":"892_CR48","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20128","volume":"28","author":"J Reese","year":"2006","unstructured":"Reese, J.: Solution methods for the p-median problem: an annotated bibliography. Networks 28(3), 125\u2013142 (2006)","journal-title":"Networks"},{"issue":"1","key":"892_CR49","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1111\/j.1538-4632.1970.tb00142.x","volume":"2","author":"C ReVelle","year":"1970","unstructured":"ReVelle, C., Swain, R.: Central facilities location. Geograph. Anal. 2(1), 30\u201342 (1970)","journal-title":"Geograph. Anal."},{"issue":"2","key":"892_CR50","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0377-2217(97)00110-0","volume":"102","author":"M Romero-Morales","year":"1997","unstructured":"Romero-Morales, M., Carrizosa, E., Conde, E.: Semi-obnoxious location models: a global optimization approach. Eur. J. Oper. Res. 102(2), 295\u2013301 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"892_CR51","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1080\/07408170500216480","volume":"38","author":"L Snyder","year":"2006","unstructured":"Snyder, L.: Facility location under uncertainty: a review. IIE Trans. 38(7), 547\u2013564 (2006)","journal-title":"IIE Trans."},{"issue":"4","key":"892_CR52","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1002\/nav.3800230402","volume":"23","author":"V Srinivasan","year":"1976","unstructured":"Srinivasan, V., Thompson, G.: Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems. Nav. Res. Logist. 23(4), 567\u2013595 (1976)","journal-title":"Nav. Res. Logist."},{"issue":"7","key":"892_CR53","doi-asserted-by":"crossref","first-page":"1582","DOI":"10.1016\/j.cor.2011.09.009","volume":"39","author":"F Tricoire","year":"2012","unstructured":"Tricoire, F., Graf, A., Gutjahr, W.: The bi-objective stochastic covering tour problem. Comput. Oper. Res. 39(7), 1582\u20131592 (2012)","journal-title":"Comput. Oper. Res."},{"key":"892_CR54","doi-asserted-by":"crossref","unstructured":"Verter, V.: Uncapacitated and capacitated facility location problems. In: Eiselt, H.A., Marianov, V. (eds.) Foundations of Location Analysis, International Series in Operations Research & Management Science, vol. 155, pp. 25\u201337. Springer, New York (2011)","DOI":"10.1007\/978-1-4419-7572-0_2"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0892-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0892-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0892-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T20:33:52Z","timestamp":1566592432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0892-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,24]]},"references-count":54,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["892"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0892-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,24]]}}}