On complexity of the bilevel location and pricing problems
DOI10.1134/S1990478914040152zbMATH Open1324.90109OpenAlexW2090548385MaRDI QIDQ5264760FDOQ5264760
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
computational complexitylocationpricingbilevel problemapproximation complexityNP-hardness in the strong senseAP-reducibilityPoly-APX-completeness
Mixed integer programming (90C11) Hierarchical games (including Stackelberg games) (91A65) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Foundations of bilevel programming
- Title not available (Why is that?)
- Structure in Approximation Classes
- The pricing problem. Part I: Exact and approximate algorithms
- The pricing problem. Part II: Computational complexity
- Uncapacitated Plant Location Under Alternative Spatial Price Policies
- Foundations of location analysis
- Pricing bridges to cross a river
- Competitive facility location model with concave demand
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
- Optimal bundle pricing with monotonicity constraint
- Optimizing pricing and location decisions for competitive service facilities charging uniform price
Cited In (5)
- The bilevel standardization problem with uniqueness condition for an optimal customer choice
- A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand
- The multilevel facility location and pricing problems: the computational complexity and the stability analysis
- Comparison of metaheuristics for the bilevel facility location and mill pricing problem
- The Stackelberg model in territorial planning
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)
