Comparison of models of planning public-private partnership

1. I. P. Glazyrina, S. M. Lavlinskii, and I. A. Kalgina, “Public-Private Partnership in the Mineral Resources Sector of Zabaikalskii Krai: Problems and Perspectives,” Geogr. Prirodn. Resursy No. 4, 89–95 (2014).

   Google Scholar 

2. I. A. Davydov, “Tabu Search for the Discrete (r|p)-Centroid Problem,” Diskretn. Anal. Issled. Oper. 19 (2), 19–40 (2012).

3. A. I. Kibzun, A. V. Naumov, and S. V. Ivanov, “A Bilevel Optimization Problem for Railway Transport Hub Planning,” in Large-Scale Systems Control, Vol. 38 (Inst. Probl. Upravl., Moscow, 2012), pp. 140–160.

   Google Scholar 

4. Yu. A. Kochetov, “Computational Bounds for Local Search in Combinatorial Optimization,” Zh. Vychisl. Mat. Mat. Fiz. 48 (5), 788–807 (2008) [Comput. Math. Math. Phys. 48 (5), 747–763 (2008)].

   MathSciNet  MATH  Google Scholar 

5. S. M. Lavlinskii, Indicator-Planning Models for Social and Economy Development of a Resource Region (Izd. Sibirsk. Otdel. Ross. Akad. Nauk, Novosibirsk, 2008) [in Russian].

   Google Scholar 

6. S. M. Lavlinskii, “Public-Private Partnership on a Resource Territory:Environmental Problems, Models, and Perspectives,” Problemy Prognoz. No. 1, 99–111 (2010).

   Google Scholar 

7. S. M. Lavlinskii and I. A. Kalgina, “Methods to Estimate Public and Private Partnership in the Mineral and RawMaterial Sector of Zabaikalskii Krai,” Vestnik Zabaikal. Gos. Univ. No. 9, 96–102 (2012).

   Google Scholar 

8. S. M. Lavlinskii, A. A. Panin, and A. V. Plyasunov, “A Bilevel Planning Model for Public-Private Partnership,” Avtomat. i Telemekh. No. 11, 89–103 (2015) [Automat. Remote Control 76 (11), 1976–1987 (2015)].

   MathSciNet  MATH  Google Scholar 

9. A. A. Panin, M. G. Pashchenko, and A. V. Plyasunov, “Bilevel Competitive Facility Location and Pricing Problems,” Avtomat. i Telemekh. No. 4, 153–169 (2014) [Automat. RemoteControl 75 (4), 715–727 (2014)].

   MathSciNet  MATH  Google Scholar 

10. E. O. Rapoport, “On Some Problems of Ground-RentModeling in a Mixed Economy,” Sibirsk. Zh. Industr. Mat. 14 (2), 95–105 (2011).

    MathSciNet  MATH  Google Scholar 

11. C. Audet, G. Savard, and W. Zghal, “New Branch-and-Cut Algorithm for Bilevel Linear Programming,” J. Optim. Theory Appl. 134 (2), 353–370 (2007).

    Article  MathSciNet  MATH  Google Scholar 

12. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties (Springer, Berlin, 1999).

    Book  MATH  Google Scholar 

13. I. A. Davydov, Yu. A. Kochetov, and E. Carrizosa, “p)-Centroid Problem on the Plane,” Electron. Notes DiscreteMath. 39, 5–12 (2012).

14. I. A. Davydov, Yu. A. Kochetov, and A. V. Plyasunov, “p)-Centroid Problem in the Plane,” TOP 22 (2), 614–623 (2014).

15. S. Dempe, Foundations of Bilevel Programming (Kluwer Acad. Publ., Dordrecht, 2002)

    MATH  Google Scholar 

16. S. T. DeNegre and T. K. Ralphs, “A Branch-and-Cut Algorithm for Integer Bilevel Linear Programs,” in Operations Research and Cyber-Infrastructure (Springer, New York, 2009), pp. 65–78.

    Google Scholar 

Download references