Comparison of metaheuristics for the bilevel facility location and mill pricing problem
DOI10.1134/S1990478915030102zbMath1349.90565OpenAlexW1797721680MaRDI QIDQ3186830
A. A. Panin, Aleksandr V. Plyasunov, Yury A. Kochetov
Publication date: 12 August 2016
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1990478915030102
facility locationpricingbilevel optimizationgenetic local search methodbilevel metaheuristicslocal improvement with variable neighborhoods
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (7)
Uses Software
Cites Work
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem
- Foundations of location analysis
- Competitive location on networks under delivered pricing
- Competitive facility location model with concave demand
- Optimal bundle pricing with monotonicity constraint
- Optimization problems and the polynomial hierarchy
- Foundations of bilevel programming
- A competitive hub location and pricing problem
- A double VNS heuristic for the facility location and pricing problem
- Genetic local search the graph partitioning problem under cardinality constraints
- Optimizing pricing and location decisions for competitive service facilities charging uniform price
- Uncapacitated Plant Location Under Alternative Spatial Price Policies
- Large neighborhood local search for the p-median problem
- The pricing problem. Part I: Exact and approximate algorithms
- On complexity of the bilevel location and pricing problems
- Competitive Location Models: A Framework and Bibliography
- Pricing bridges to cross a river
- Variable neighborhood search: Principles and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Comparison of metaheuristics for the bilevel facility location and mill pricing problem