Exact method for the capacitated competitive facility location problem
From MaRDI portal
Publication:1652629
DOI10.1016/j.cor.2018.02.013zbMath1458.90412OpenAlexW2791530219MaRDI QIDQ1652629
Vladimir Beresnev, Andrey Melnikov
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.02.013
Mixed integer programming (90C11) Hierarchical games (including Stackelberg games) (91A65) Discrete location and assignment (90B80)
Related Items (5)
A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem ⋮ Approximation of the competitive facility location problem with MIPs ⋮ Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors ⋮ A Cut Generation Algorithm of Finding an Optimal Solution in a Market Competition
Uses Software
Cites Work
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Branch-and-bound algorithm for a competitive facility location problem
- A local search heuristic for the \((r| p)\)-centroid problem in the plane
- A leader-follower model for discrete competitive facility location
- Sequential competitive location on networks
- On the complexity of the \((r|p)\)-centroid problem in the plane
- On the competitive facility location problem with a free choice of suppliers
- Randomized local search for the discrete competitive facility location problem
- An exact procedure and LP formulations for the leader-follower location problem
- Multiple voting location and single voting location on trees
- The leader-follower location model
- On a branch-and-bound approach for a Huff-like Stackelberg location problem
- Sequential location problems
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- A leader-follower game in competitive facility location
- A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
- Recent insights in Huff-like competitive facility location and design
- A bilevel mixed-integer program for critical infrastructure protection planning
- A capacitated competitive facility location problem
- Upper Bound for the Capacitated Competitive Facility Location Problem
- The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers
- Computational complexity of the discrete competitive facility location problem
- Modeling Discrete Competitive Facility Location
This page was built for publication: Exact method for the capacitated competitive facility location problem
