The pricing problem. I: Exact and approximate algorithms
DOI10.1134/S1990478913020142zbMATH Open1324.68048OpenAlexW2086234016MaRDI QIDQ5263791FDOQ5263791
Authors: A. A. Panin, A. V. Plyasunov 
Publication date: 17 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/s1990478913020142
Recommendations
decompositionhybrid algorithmlocal searchgenetic algorithmtabu searchminimax problembilevel problempricing problemNP-hard in the strong sense
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Microeconomic theory (price theory and economic markets) (91B24)
Cited In (15)
- Title not available (Why is that?)
- A bilevel planning model for public-private partnership
- The pricing problem. Part II: Computational complexity
- Bilevel competitive facility location and pricing problems
- On the competitive facility location problem with a free choice of suppliers
- A capacitated competitive facility location problem
- On complexity of the bilevel location and pricing problems
- The multilevel facility location and pricing problems: the computational complexity and the stability analysis
- An exact algorithm for the network pricing problem
- On a three-level competitive pricing problem with uniform and mill pricing strategies
- Efficient heuristic algorithms for maximum utility product pricing problems
- Comparison of metaheuristics for the bilevel facility location and mill pricing problem
- A double VNS heuristic for the facility location and pricing problem
- Title not available (Why is that?)
- Approximation algorithms for pricing with negative network externalities
This page was built for publication: The pricing problem. I: Exact and approximate algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263791)
