On complexity of the bilevel location and pricing problems

DOI10.1134/S1990478914040152zbMath1324.90109OpenAlexW2090548385MaRDI QIDQ5264760

A. A. Panin, Aleksandr V. Plyasunov

Publication date: 27 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478914040152

zbMATH Keywords

computational complexitylocationpricingbilevel problemapproximation complexityNP-hardness in the strong senseAP-reducibilityPoly-APX-completeness

Mathematics Subject Classification ID

Mixed integer programming (90C11) Hierarchical games (including Stackelberg games) (91A65) Discrete location and assignment (90B80)

Related Items

Comparison of metaheuristics for the bilevel facility location and mill pricing problem ⋮ The multilevel facility location and pricing problems: the computational complexity and the stability analysis ⋮ The Stackelberg model in territorial planning ⋮ A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand

Cites Work

• Unnamed Item
• Unnamed Item
• Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
• Foundations of location analysis
• Competitive facility location model with concave demand
• Optimal bundle pricing with monotonicity constraint
• Foundations of bilevel programming
• Optimizing pricing and location decisions for competitive service facilities charging uniform price
• Uncapacitated Plant Location Under Alternative Spatial Price Policies
• Structure in Approximation Classes
• The pricing problem. Part I: Exact and approximate algorithms
• The pricing problem. Part II: Computational complexity
• Pricing bridges to cross a river