R. Bard, J. F. Moore, and J. T. , An algorithm for the discrete bilevel programming problem, Naval Research Logistics, vol.14, issue.3, pp.419-435, 1992.
DOI : 10.1002/1520-6750(199204)39:3<419::AID-NAV3220390310>3.0.CO;2-C

R. Church and C. R. Velle, THE MAXIMAL COVERING LOCATION PROBLEM, Papers in Regional Science, vol.32, issue.1, pp.101-118, 1974.
DOI : 10.1111/j.1435-5597.1974.tb00902.x

M. S. Daskin, Network and discrete location: models, algorithms, and applications, 2011.
DOI : 10.1002/9781118032343

H. Eiselt and G. Laporte, Competitive spatial models, European Journal of Operational Research, vol.39, issue.3, pp.231-242, 1989.
DOI : 10.1016/0377-2217(89)90161-6

H. Eiselt and G. Laporte, Sequential location problems, European Journal of Operational Research, vol.96, issue.2, pp.217-231, 1997.
DOI : 10.1016/S0377-2217(96)00216-0

H. Eiselt, G. Laporte, and J. Thisse, Competitive Location Models: A Framework and Bibliography, Transportation Science, vol.27, issue.1, pp.44-54, 1993.
DOI : 10.1287/trsc.27.1.44

M. Fischetti, I. Ljubic, M. Monaci, and M. Sinnl, Intersection Cuts for Bilevel Optimization, IPCO 2016 Proceedings, pp.77-88, 2016.
DOI : 10.1016/j.cor.2013.07.016

T. Friesz, T. Miller, and R. Tobin, COMPETITIVE NETWORK FACIUTY LOCATION MODELS: A SURVEY, Papers in Regional Science, vol.65, issue.1, pp.47-57, 1988.
DOI : 10.1111/j.1435-5597.1988.tb01157.x

S. Hakimi, On locating new facilities in a competitive environment, European Journal of Operational Research, vol.12, issue.1, pp.29-35, 1983.
DOI : 10.1016/0377-2217(83)90180-7

E. Israeli and R. K. Wood, Shortest-path network interdiction, Networks, vol.17, issue.2, pp.97-111, 2002.
DOI : 10.5711/morj.4.4.15

D. Kress and E. Pesch, Sequential competitive location on networks, European Journal of Operational Research, vol.217, issue.3, pp.483-499, 2012.
DOI : 10.1016/j.ejor.2011.06.036

J. T. Moore and J. F. Bard, The Mixed Integer Linear Bilevel Programming Problem, Operations Research, vol.38, issue.5, pp.911-921, 1990.
DOI : 10.1287/opre.38.5.911

H. Noltemeier, J. Spoerhase, and H. Wirth, Multiple voting location and single voting location on trees, European Journal of Operational Research, vol.181, issue.2, pp.654-667, 2007.
DOI : 10.1016/j.ejor.2006.06.039

O. Hanley, J. R. Church, and R. L. , Designing robust coverage networks to hedge against worst-case facility losses, European Journal of Operational Research, vol.209, issue.1, pp.23-36, 2011.

F. Plastria and L. Vanhaverbeke, Discrete models for competitive location with foresight, Computers & Operations Research, vol.35, issue.3, pp.683-700, 2008.
DOI : 10.1016/j.cor.2006.05.006

M. C. Roboredo and A. A. Pessoa, A branch-and-cut algorithm for the discrete (r???p)-centroid problem, European Journal of Operational Research, vol.224, issue.1, pp.101-109, 2013.
DOI : 10.1016/j.ejor.2012.07.042

D. Serra, S. Ratick, and C. Revelle, The Maximum Capture Problem with Uncertainty, Environment and Planning B: Planning and Design, vol.6, issue.1, pp.49-59, 1996.
DOI : 10.1007/BF02023794

D. Serra and C. Revelle, MARKET CAPTURE BY TWO COMPETITORS: THE PREEMPTIVE LOCATION PROBLEM*, Journal of Regional Science, vol.16, issue.4, pp.549-561, 1994.
DOI : 10.1016/0377-2217(92)90125-S

T. H. Seyhan, Network design under competitionTheses and Dissertations . Paper, 1266.

Z. C. Ta¸sk?nta¸sk?n, J. C. Smith, S. Ahmed, and A. J. Schaefer, Cutting plane algorithms for solving a stochastic edge-partition problem, Discrete Optimization, vol.6, issue.4, pp.420-435, 2009.
DOI : 10.1016/j.disopt.2009.05.004