The pricing problem. I: Exact and approximate algorithms
From MaRDI portal
Publication:5263791
Recommendations
Cited in
(15)- A bilevel planning model for public-private partnership
- scientific article; zbMATH DE number 1985662 (Why is no real title available?)
- 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
- An exact algorithm for the network pricing problem
- The multilevel facility location and pricing problems: the computational complexity and the stability analysis
- 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
- Approximation algorithms for pricing with negative network externalities
- scientific article; zbMATH DE number 1094752 (Why is no real title available?)
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)