1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
2. Akinc, U., Khumawala, B.M.: An efficient branch and bound algorithm for the capacitated warehouse location problem. Manag. Sci. 23(6), 585–594 (1977)
3. 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–151. Springer, Berlin (2013)
4. 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–797 (2005)
5. Balinski, M.L., Wolfe, P:. On Benders decomposition and a plant location problem. Working paper-ARO 27. Mathematica, Princeton (1963)