Discrete Competitive Facility Location: Modeling and Optimization Approaches
From MaRDI portal
Publication:5270511
DOI10.1007/978-3-319-18567-5_8zbMath1365.90160OpenAlexW2342071621MaRDI QIDQ5270511
Publication date: 23 June 2017
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18567-5_8
bi-level programmingcompetitive facility location\((r|p)\)-centroid problem\((r|X_p)\)-medianoid problemlocation under customers competition
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Branch-and-bound algorithm for a competitive facility location problem
- Sequential competitive location on networks
- On the competitive facility location problem with a free choice of suppliers
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem
- Randomized local search for the discrete competitive facility location problem
- An exact procedure and LP formulations for the leader-follower location problem
- Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
- An exact method for the discrete \((r|p)\)-centroid problem
- On locating new facilities in a competitive environment
- A leader-follower game in competitive facility location
- A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
- A bi-level programming model and solution algorithm for the location of logistics distribution centers
- Computational complexity of the discrete competitive facility location problem
- Competitive Location Models: A Framework and Bibliography
This page was built for publication: Discrete Competitive Facility Location: Modeling and Optimization Approaches
