1. V. L. Beresnev, Discrete Location Problems and Polynomials of Boolean Variables (Inst. Mat., Novosibirsk, 2005) [in Russian].
2. V. L. Beresnev, “Upper Bounds forObjective Functions of Discrete Competitive Facility Location Problems,” Diskret. Anal. Issled. Oper. 15(4), 3–24 (2008) [J. Appl. Indust. Math. 3 (4), 419–432 (2009)].
3. C. Campos and J. A. Moreno, “Multiple Voting Location Problems,” Europ. J. Oper. Res. 191(2), 436–452 (2008).
4. S. Dempe, Foundations of Bilevel Programming (Kluwer Acad. Publ., Dordrecht, 2002).
5. H. A. Eiselt and G. Laporte, “Sequential Location Problems,” Europ. J. Oper. Res. 96, 217–231 (1996).