TY - JOUR

T1 - The Stackelberg Model in Territorial Planning

AU - Lavlinskii, S. M.

AU - Panin, A. A.

AU - Plyasunov, A. V.

PY - 2019/2/1

Y1 - 2019/2/1

N2 - We propose a new model for the formation of a public-private partnership mechanism, formulated as a bilevel Boolean programming problem. We show that this task is ∑ 2 P -hard in both optimistic and pessimistic forms. We develop a stochastic iterative algorithm for solving this problem. We also present computational experiments on real information that demonstrate the capabilities of the proposed approach.

AB - We propose a new model for the formation of a public-private partnership mechanism, formulated as a bilevel Boolean programming problem. We show that this task is ∑ 2 P -hard in both optimistic and pessimistic forms. We develop a stochastic iterative algorithm for solving this problem. We also present computational experiments on real information that demonstrate the capabilities of the proposed approach.

KW - bilevel mathematical programming problems

KW - computational complexity

KW - Stackelberg game

KW - stochastic local search

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

U2 - 10.1134/S0005117919020073

DO - 10.1134/S0005117919020073

M3 - Article

AN - SCOPUS:85064907337

VL - 80

SP - 286

EP - 296

JO - Automation and Remote Control

JF - Automation and Remote Control

SN - 0005-1179

IS - 2

ER -