A double VNS heuristic for the facility location and pricing problem
From MaRDI portal
Publication:2840748
DOI10.1016/j.endm.2012.10.005zbMath1268.90141OpenAlexW2115669918MaRDI QIDQ2840748
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.005
Approximation methods and heuristics in mathematical programming (90C59) Microeconomic theory (price theory and economic markets) (91B24) Discrete location and assignment (90B80)
Related Items (10)
A bilevel planning model for public-private partnership ⋮ Comparison of metaheuristics for the bilevel facility location and mill pricing problem ⋮ Bi-objective vibration damping optimization for congested location-pricing problem ⋮ The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches ⋮ The multilevel facility location and pricing problems: the computational complexity and the stability analysis ⋮ Facility location and pricing problem: discretized mill price and exact algorithms ⋮ Unnamed Item ⋮ A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand ⋮ The Branch and Cut Method for the Clique Partitioning Problem ⋮ An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system
Cites Work
- Competitive location on networks under delivered pricing
- Sequential discrete \(p\)-facility models for competitive location planning
- 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
- Competitive Location Models: A Framework and Bibliography
- Variable neighborhood search: Principles and applications
This page was built for publication: A double VNS heuristic for the facility location and pricing problem
