Standard

Comparison of models of planning public-private partnership. / Lavlinskii, S. M.; Panin, A. A.; Plyasunov, A. V.

In: Journal of Applied and Industrial Mathematics, Vol. 10, No. 3, 01.07.2016, p. 356-369.

Research output: Contribution to journal › Article › peer-review

Harvard

Lavlinskii, SM, Panin, AA & Plyasunov, AV 2016, 'Comparison of models of planning public-private partnership', Journal of Applied and Industrial Mathematics, vol. 10, no. 3, pp. 356-369. https://doi.org/10.1134/S1990478916030066

APA

Lavlinskii, S. M., Panin, A. A., & Plyasunov, A. V. (2016). Comparison of models of planning public-private partnership. Journal of Applied and Industrial Mathematics, 10(3), 356-369. https://doi.org/10.1134/S1990478916030066

Vancouver

Lavlinskii SM, Panin AA, Plyasunov AV. Comparison of models of planning public-private partnership. Journal of Applied and Industrial Mathematics. 2016 Jul 1;10(3):356-369. doi: 10.1134/S1990478916030066

Author

Lavlinskii, S. M. ; Panin, A. A. ; Plyasunov, A. V. / Comparison of models of planning public-private partnership. In: Journal of Applied and Industrial Mathematics. 2016 ; Vol. 10, No. 3. pp. 356-369.

BibTeX

@article{425333809072491f92cc2dd5035be5f8,
title = "Comparison of models of planning public-private partnership",
abstract = "We propose two new mathematical formulations of the planning problem of publicprivate partnership. One of the models is bilevel, and the other is one-level. We characterize the computational complexity and develop some algorithms for solving these problems. A special model polygon is built to carry out computational experiment. The polygon takes into account the specificity of the original information base. Basing on numerical experiments, we analyze the properties of the optimal solutions. This allows us to assess the adequacy of the underlying assumptions of the models with the current state of affairs in the field of project management of public-private partnership.",
keywords = "approximation hierarchy, bilevel problem, class Σ O, hybrid algorithm, local search, NPO-hard problem, public-private partnership",
author = "Lavlinskii, {S. M.} and Panin, {A. A.} and Plyasunov, {A. V.}",
year = "2016",
month = jul,
day = "1",
doi = "10.1134/S1990478916030066",
language = "English",
volume = "10",
pages = "356--369",
journal = "Journal of Applied and Industrial Mathematics",
issn = "1990-4789",
publisher = "Maik Nauka-Interperiodica Publishing",
number = "3",

}

RIS

TY - JOUR

T1 - Comparison of models of planning public-private partnership

AU - Lavlinskii, S. M.

AU - Panin, A. A.

AU - Plyasunov, A. V.

PY - 2016/7/1

Y1 - 2016/7/1

N2 - We propose two new mathematical formulations of the planning problem of publicprivate partnership. One of the models is bilevel, and the other is one-level. We characterize the computational complexity and develop some algorithms for solving these problems. A special model polygon is built to carry out computational experiment. The polygon takes into account the specificity of the original information base. Basing on numerical experiments, we analyze the properties of the optimal solutions. This allows us to assess the adequacy of the underlying assumptions of the models with the current state of affairs in the field of project management of public-private partnership.

AB - We propose two new mathematical formulations of the planning problem of publicprivate partnership. One of the models is bilevel, and the other is one-level. We characterize the computational complexity and develop some algorithms for solving these problems. A special model polygon is built to carry out computational experiment. The polygon takes into account the specificity of the original information base. Basing on numerical experiments, we analyze the properties of the optimal solutions. This allows us to assess the adequacy of the underlying assumptions of the models with the current state of affairs in the field of project management of public-private partnership.

KW - approximation hierarchy

KW - bilevel problem

KW - class Σ O

KW - hybrid algorithm

KW - local search

KW - NPO-hard problem

KW - public-private partnership

UR - http://www.scopus.com/inward/record.url?scp=84983543052&partnerID=8YFLogxK

U2 - 10.1134/S1990478916030066

DO - 10.1134/S1990478916030066

M3 - Article

AN - SCOPUS:84983543052

VL - 10

SP - 356

EP - 369

JO - Journal of Applied and Industrial Mathematics

JF - Journal of Applied and Industrial Mathematics

SN - 1990-4789

IS - 3

ER -

ID: 25353121