On complexity of the bilevel location and pricing problems

DOI10.1134/S1990478914040152MaRDI QIDQ5264760zbMATH OpenOpenAlexFDO

Authors A. A. Panin, A. 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)

Recommendations

• Bilevel competitive facility location and pricing problems
• A bilevel competitive location and pricing model with nonuniform split of demand
• Computational Difficulties of Bilevel Linear Programming
• Bilevel programming and price setting problems
• Bilevel programming and price setting problems

Cites work

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

Cited in

(7)

• Bilevel competitive facility location and pricing problems
• The bilevel standardization problem with uniqueness condition for an optimal customer choice
• The multilevel facility location and pricing problems: the computational complexity and the stability analysis
• Asymmetry in the complexity of the multi-commodity network pricing problem
• Comparison of metaheuristics for the bilevel facility location and mill pricing problem
• The Stackelberg model in territorial planning
• A bilevel competitive location and pricing model with nonuniform split of demand

This page was built for publication: On complexity of the bilevel location and pricing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264760)