Comparison of models of planning public-private partnership
DOI10.1134/S1990478916030066zbMath1374.90216OpenAlexW2518190130MaRDI QIDQ2959184
A. A. Panin, S. M. Lavlinskii, Aleksandr V. Plyasunov
Publication date: 9 February 2017
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1990478916030066
local searchhybrid algorithmpublic-private partnershipbilevel problemapproximation hierarchyclass \(\Sigma_2^pO\)NPO-hard problem
Applications of mathematical programming (90C90) Management decision making, including multiple objectives (90B50) Case-oriented studies in operations research (90B90) Boolean programming (90C09)
Related Items (5)
Cites Work
- A bilevel planning model for public-private partnership
- On the complexity of the \((r|p)\)-centroid problem in the plane
- Bilevel competitive facility location and pricing problems
- Foundations of bilevel programming
- New branch-and-Cut algorithm for bilevel linear programming
- VNS heuristic for the –centroid problem on the plane
- Computational bounds for local search in combinatorial optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Comparison of models of planning public-private partnership