Approximation of the competitive facility location problem with MIPs
From MaRDI portal
Publication:1725607
DOI10.1016/j.cor.2018.12.010zbMath1458.90413OpenAlexW2905554915WikidataQ128744135 ScholiaQ128744135MaRDI QIDQ1725607
Andrey Melnikov, Vladimir Beresnev
Publication date: 14 February 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.12.010
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Hierarchical games (including Stackelberg games) (91A65) Discrete location and assignment (90B80)
Related Items
Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution ⋮ Upper bound for the competitive facility location problem with demand uncertainty ⋮ Unnamed Item ⋮ A Cut Generation Algorithm of Finding an Optimal Solution in a Market Competition ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
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 leader-follower model for discrete competitive facility location
- Sequential competitive location on networks
- On the competitive facility location problem with a free choice of suppliers
- Randomized local search for the discrete competitive facility location problem
- Multiple voting location and single voting location on trees
- The leader-follower location model
- Generalized coverage: new developments in covering location models
- Competitive spatial models
- Sequential location problems
- Foundations of bilevel programming
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule
- Exact method for the capacitated competitive facility location problem
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- A leader-follower game in competitive facility location
- Competitive facility location: the Voronoi game
- Polyhedral study of simple plant location problem with order
- Nash equilibria in location games on a network
- Recent insights in Huff-like competitive facility location and design
- Competitive location and pricing on networks with random utilities
- An overview of bilevel optimization
- A strengthened formulation for the simple plant location problem with order
- Noncooperative facility location games
- Voronoi Games on Cycle Graphs
- Competitive Location on a Network
- The Mixed Integer Linear Bilevel Programming Problem
- Computational complexity of the discrete competitive facility location problem
- Modeling Discrete Competitive Facility Location
This page was built for publication: Approximation of the competitive facility location problem with MIPs
