{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T20:45:03Z","timestamp":1773866703197,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,7,11]],"date-time":"2015-07-11T00:00:00Z","timestamp":1436572800000},"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":[[2016,6]]},"DOI":"10.1007\/s11590-015-0918-z","type":"journal-article","created":{"date-parts":[[2015,7,10]],"date-time":"2015-07-10T07:34:32Z","timestamp":1436513672000},"page":"997-1019","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints"],"prefix":"10.1007","volume":"10","author":[{"given":"Massimiliano","family":"Caramia","sequence":"first","affiliation":[]},{"given":"Renato","family":"Mari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,11]]},"reference":[{"key":"918_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"issue":"6","key":"918_CR2","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1287\/mnsc.23.6.585","volume":"23","author":"U Akinc","year":"1977","unstructured":"Akinc, U., Khumawala, B.M.: An efficient branch and bound algorithm for the capacitated warehouse location problem. Manag. Sci. 23(6), 585\u2013594 (1977)","journal-title":"Manag. Sci."},{"key":"918_CR3","first-page":"115","volume-title":"Metaheuristics for Bi-Level Optimization Studies in Computational Intelligence, Studies in Computational Intelligence","author":"D Aksen","year":"2013","unstructured":"Aksen, D., Aras, N.: A matheuristic for leader-follower games involving facility location-protection-interdiction decisions. In: Talbi, E. (ed.) Metaheuristics for Bi-Level Optimization Studies in Computational Intelligence, Studies in Computational Intelligence, vol. 482, pp. 115\u2013151. Springer, Berlin (2013)"},{"issue":"2","key":"918_CR4","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1109\/TPWRS.2005.846198","volume":"20","author":"JM Arroyo","year":"2005","unstructured":"Arroyo, J.M., Galiana, F.D.: On the solution of the bilevel programming formulation of the terrorist threat problem. IEEE Trans. Power Syst. 20(2), 789\u2013797 (2005)","journal-title":"IEEE Trans. Power Syst."},{"key":"918_CR5","unstructured":"Balinski, M.L., Wolfe, P:. On Benders decomposition and a plant location problem. Working paper-ARO 27. Mathematica, Princeton (1963)"},{"key":"918_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2836-1","volume-title":"Practical Bilevel Optimization: Algorithms and Applications","author":"JF Bard","year":"1998","unstructured":"Bard, J.F.: Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers, Boston (1998)"},{"issue":"2","key":"918_CR7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0911017","volume":"11","author":"JF Bard","year":"1990","unstructured":"Bard, J.F., Moore, J.T.: A branch and bound algorithm for the bilevel programming problem. SIAM J. Sci. Stat. Comput. 11(2), 281\u2013292 (1990)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"1","key":"918_CR8","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238\u2013252 (1962)","journal-title":"Numer. Math."},{"issue":"1","key":"918_CR9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1504\/EJIE.2015.067450","volume":"9","author":"L Bianco","year":"2015","unstructured":"Bianco, L., Caramia, M., Giordani, S., Mari, R.: Grid scheduling by bilevel programming: a heuristic approach. Eur. J. Ind. Eng. 9(1), 101\u2013125 (2015)","journal-title":"Eur. J. Ind. Eng."},{"key":"918_CR10","doi-asserted-by":"crossref","unstructured":"Camacho-Vallejo, J.F., Cordero-Franco, A.E., Gonz\u00e1lez-Ram\u00edrez, R.G.: Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm. Math. Prob. Eng. 2014, 1\u201314 (2014)","DOI":"10.1155\/2014\/430243"},{"issue":"1","key":"918_CR11","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.ejor.2004.05.016","volume":"169","author":"D Cao","year":"2006","unstructured":"Cao, D., Chen, M.: Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach. Eur. J. Oper. Res. 169(1), 97\u2013110 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"918_CR12","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G Cornuejols","year":"1977","unstructured":"Cornuejols, G., Fisher, M., Nemhauser, G.L.: Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manag. Sci. 23(8), 789\u2013810 (1977)","journal-title":"Manag. Sci."},{"key":"918_CR13","first-page":"119","volume-title":"Discrete Location Theory","author":"G Cornuejols","year":"1990","unstructured":"Cornuejols, G., Nemhauser, L.G., Wolsey, L.A.: The uncapacitated facility location problem. In: Mirchandani, P., Francis, R. (eds.) Discrete Location Theory, pp. 119\u2013171. Wiley, New York (1990)"},{"key":"918_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032343","volume-title":"Network and Discrete Location: Models, Algorithms, and Applications","author":"MS Daskin","year":"1995","unstructured":"Daskin, M.S.: Network and Discrete Location: Models, Algorithms, and Applications. Wiley, New York (1995)"},{"key":"918_CR15","volume-title":"Foundation of Bilevel Programming","author":"S Dempe","year":"2002","unstructured":"Dempe, S.: Foundation of Bilevel Programming. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"3","key":"918_CR16","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1287\/opre.14.3.361","volume":"14","author":"MA Efroymson","year":"1966","unstructured":"Efroymson, M.A., Ray, T.L.: A branch-bound algorithm for plant location. Oper. Res. 14(3), 361\u2013368 (1966)","journal-title":"Oper. Res."},{"issue":"6","key":"918_CR17","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D Erlenkotter","year":"1978","unstructured":"Erlenkotter, D.: A dual-based procedure for uncapacitated facility location. Oper. Res. 26(6), 992\u20131009 (1978)","journal-title":"Oper. Res."},{"key":"918_CR18","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.trb.2014.09.007","volume":"70","author":"P Fontaine","year":"2014","unstructured":"Fontaine, P., Minner, S.: Benders decomposition for discrete-continuous linear bilevel problems with application to traffic network design. Transp. Res. Part B Methodol. 70, 163\u2013172 (2014)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"9","key":"918_CR19","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1057\/jors.1981.156","volume":"32","author":"J Fortuny-Amat","year":"1981","unstructured":"Fortuny-Amat, J., McCarl, B.: A representation and economic interpretation of a two-level programming problem. J. Oper. Res. Soc. 32(9), 783\u2013792 (1981)","journal-title":"J. Oper. Res. Soc."},{"key":"918_CR20","doi-asserted-by":"crossref","first-page":"1404","DOI":"10.1057\/jors.2009.84","volume":"61","author":"SA Gabriel","year":"2010","unstructured":"Gabriel, S.A., Shim, Y., Conejo, A.J., de la Torre, S., Garcia-Bertrand, R.: A Benders decomposition method for discretely constrained mathematical programs with equilibrium constraints. J. Oper. Res. Soc. 61, 1404\u20131419 (2010)","journal-title":"J. Oper. Res. Soc."},{"issue":"5","key":"918_CR21","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","volume":"20","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion, A.M., Graves, G.W.: Multicommodity distribution system design by Benders decomposition. Manag. Sci. 20(5), 822\u2013844 (1974)","journal-title":"Manag. Sci."},{"issue":"6","key":"918_CR22","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/0098-1354(87)87011-4","volume":"11","author":"IE Grossmann","year":"1987","unstructured":"Grossmann, I.E., Floudas, C.A.: Active constraint strategy for flexibility analysis in chemical processes. Comput. Chem. Eng. 11(6), 675\u2013693 (1987)","journal-title":"Comput. Chem. Eng."},{"issue":"5","key":"918_CR23","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1137\/0913069","volume":"13","author":"P Hansen","year":"1992","unstructured":"Hansen, P., Jaumard, P., Savard, G.: New branch-and-bound rules for linear bilevel programming. SIAM J. Sci. Stat. Comput. 13(5), 1194\u20131217 (1992)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"918_CR24","unstructured":"Hansen, P., Kochetov, Y., Mladenovic, N.: Lower bounds for the uncapacitated facility location problem with user preferences. Les Cahiers du GERAD G-2004-24 (2004)"},{"issue":"3","key":"918_CR25","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0166-0462(87)90011-1","volume":"17","author":"P Hanjoul","year":"1987","unstructured":"Hanjoul, P., Peeters, D.: A facility location problem with clients\u2019 preferences. Reg. Sci. Urban Econ. 17(3), 451\u2013473 (1987)","journal-title":"Reg. Sci. Urban Econ."},{"issue":"2","key":"918_CR26","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01586088","volume":"32","author":"RG Jeroslow","year":"1985","unstructured":"Jeroslow, R.G.: The polynomial hierarchy and a simple model for competitive analysis. Math. Prog. 32(2), 146\u2013164 (1985)","journal-title":"Math. Prog."},{"key":"918_CR27","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Compl. Comp. Comp.","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Tatcher, J.W. (eds.) Compl. Comp. Comp., pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"12","key":"918_CR28","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1287\/mnsc.18.12.B718","volume":"18","author":"BM Khumawala","year":"1972","unstructured":"Khumawala, B.M.: An efficient branch-and-bound algorithm for the warehouse location problem. Manag. Sci. 18(12), 718\u2013731 (1972)","journal-title":"Manag. Sci."},{"key":"918_CR29","unstructured":"Kochetov, Y., Kochetova, N., Plyasunov, A.: A matheuristic for the leader-follower facility location and design problem. In: Proceedings of the 10th Metaheuristics International Conference (MIC 2013), pp. 32\/1\u201332\/3 (2013)"},{"issue":"1","key":"918_CR30","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."},{"issue":"4","key":"918_CR31","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","volume":"9","author":"AA Kuehn","year":"1963","unstructured":"Kuehn, A.A., Hamburger, M.J.: A heuristic program for location warehouses. Manag. Sci. 9(4), 643\u2013666 (1963)","journal-title":"Manag. Sci."},{"key":"918_CR32","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/j.endm.2010.05.075","volume":"36","author":"C Losada","year":"2010","unstructured":"Losada, C., Scaparra, M.P., Church, R.L.: On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions. Electron. Notes Discrete Math. 36, 591\u2013598 (2010)","journal-title":"Electron. Notes Discrete Math."},{"issue":"3","key":"918_CR33","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/j.ejor.2011.09.044","volume":"217","author":"C Losada","year":"2010","unstructured":"Losada, C., Scaparra, M.P., O\u2019Hanley, J.R.: Optimizing system resilience: a facility protection model with recovery time. Eur. J. Oper. Res. 217(3), 519\u2013530 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"918_CR34","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1287\/opre.40.3.564","volume":"40","author":"FV Louveaux","year":"1992","unstructured":"Louveaux, F.V., Peeters, D.: A dual-based procedure for stochastic facility location. Oper. Res. 40(3), 564\u2013573 (1992)","journal-title":"Oper. Res."},{"key":"918_CR35","unstructured":"Mari, R.: Integer bilevel linear programming problems: new results and applications. PhD thesis, University of Rome Sapienza, Italy (2014)"},{"issue":"12","key":"918_CR36","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1057\/jors.1978.263","volume":"29","author":"RM Nauss","year":"1978","unstructured":"Nauss, R.M.: An improved algorithm for the capacitated facility location problem. J. Oper. Res. Soc. 29(12), 1195\u20131201 (1978)","journal-title":"J. Oper. Res. Soc."},{"issue":"6","key":"918_CR37","doi-asserted-by":"crossref","first-page":"1905","DOI":"10.1016\/j.cor.2006.09.019","volume":"35","author":"MP Scaparra","year":"2008","unstructured":"Scaparra, M.P., Church, R.L.: A bilevel mixed-integer program for critical infrastructure protection planning. Comput. Oper. Res. 35(6), 1905\u20131923 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"918_CR38","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.ejor.2007.05.027","volume":"189","author":"MP Scaparra","year":"2008","unstructured":"Scaparra, M.P., Church, R.L.: An exact solution approach for the interdiction median problem with fortification. Eur. J. Oper. Res. 189(1), 76\u201392 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"918_CR39","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10898-008-9291-0","volume":"44","author":"GK Saharidis","year":"2009","unstructured":"Saharidis, G.K., Ierapetritou, M.G.: Resolution method for mixed integer bi-level linear problems based on decomposition technique. J. Global Optim. 44(1), 29\u201351 (2009)","journal-title":"J. Global Optim."},{"key":"918_CR40","unstructured":"Swain, R.: A decomposition algorithm for a class of facility location problems. PhD thesis, Cornell University, Ithaca (1971)"},{"issue":"3","key":"918_CR41","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1134\/S1990478910030178","volume":"4","author":"IL Vasilyev","year":"2010","unstructured":"Vasilyev, I.L., Klimentova, K.B.: The branch and cut method for the location problem with client\u2019s preferences. J. Appl. Ind. Math. 4(3), 441\u2013454 (2010)","journal-title":"J. Appl. Ind. Math."},{"key":"918_CR42","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-1-4419-7572-0_2","volume-title":"Found. Loc. Anal.","author":"V Verter","year":"2011","unstructured":"Verter, V.: Uncapacitated and capacitated facility location problems. In: Eiselt, H.A., Marianov, V. (eds.) Found. Loc. Anal., pp. 25\u201337. Springer, New York (2011)"},{"issue":"2","key":"918_CR43","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF02191670","volume":"81","author":"LN Vicente","year":"1996","unstructured":"Vicente, L.N., Savard, G., Judice, J.J.: Descent approaches for quadratic bilevel programming. J. Optim. Theory Appl. 81(2), 379\u2013399 (1996)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"918_CR44","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/BF02275351","volume":"89","author":"LN Vicente","year":"1996","unstructured":"Vicente, L.N., Savard, G., Judice, J.J.: Discrete linear bilevel programming problem. J. Optim. Theory Appl. 89(3), 597\u2013614 (1996)","journal-title":"J. Optim. Theory Appl."},{"key":"918_CR45","volume-title":"Integer Programming. Wiley-Interscience Series","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley-Interscience Series. Wiley, New York (1998)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0918-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0918-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0918-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:42Z","timestamp":1559409102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0918-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,11]]},"references-count":45,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["918"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0918-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,11]]}}}