A variable neighborhood search algorithm for the (r p) hub-centroid problem under the price war
DOI10.1007/S10898-021-01036-9zbMATH Open1492.90075OpenAlexW3164162652MaRDI QIDQ2149602FDOQ2149602
Yury Kochetov, A. V. Plyasunov, Aleksandar Savić, Dimitrije D. Čvokić
Publication date: 29 June 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01036-9
Recommendations
- Variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
- The competitive hub location under the price war
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Mixed integer programming (90C11) Microeconomic theory (price theory and economic markets) (91B24) Discrete location and assignment (90B80)
Cites Work
- On Hotelling's "Stability in Competition"
- Foundations of bilevel programming
- A quadratic integer program for the location of interacting hub facilities
- A competitive hub location and pricing problem
- Network hub location problems: The state of the art
- Hub location problems with price sensitive demands
- Hub Location Problems: The Location of Interacting Facilities
- Variable neighborhood search
- An alternating heuristic for medianoid and centroid problems in the plane
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem
- Bilevel competitive facility location and pricing problems
- Hub location under competition
- STACKELBERG HUB LOCATION PROBLEM
- HUB NETWORK DESIGN MODEL IN A COMPETITIVE ENVIRONMENT WITH FLOW THRESHOLD
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- A leader-follower game in competitive facility location
- Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane
- A Leader-Follower Hub Location Problem Under Fixed Markups
- A leader-follower single allocation hub location problem under fixed markups
- A single allocation hub location and pricing problem
- The competitive hub location under the price war
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
- Handbook of metaheuristics
- Comparison of metaheuristics for the bilevel facility location and mill pricing problem
Cited In (2)
Uses Software
This page was built for publication: A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149602)
