Approximation of the competitive facility location problem with MIPs
From MaRDI portal
Recommendations
- Approximate algorithms for the competitive facility location problem
- Approximation algorithms for multicommodity facility location problems
- scientific article; zbMATH DE number 1670526
- Approximation Algorithms for Metric Facility Location Problems
- scientific article; zbMATH DE number 1559542
- Approximation algorithms for bounded facility location problems
- An approximation framework for bounded facility location problems
- An approximation algorithm for a large-scale facility location problem
- Integer Programming and Combinatorial Optimization
- LP-based approximation algorithms for capacitated facility location
Cites work
- A leader-follower game in competitive facility location
- A leader-follower model for discrete competitive facility location
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule
- A strengthened formulation for the simple plant location problem with order
- An overview of bilevel optimization
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Branch-and-bound algorithm for a competitive facility location problem
- Competitive facility location: the Voronoi game
- Competitive location and pricing on networks with random utilities
- Competitive Location on a Network
- Competitive spatial models
- Computational complexity of the discrete competitive facility location problem
- Exact method for the capacitated competitive facility location problem
- Foundations of bilevel programming
- Generalized coverage: new developments in covering location models
- Modeling Discrete Competitive Facility Location
- Multiple voting location and single voting location on trees
- Nash equilibria in location games on a network
- Noncooperative facility location games
- On the competitive facility location problem with a free choice of suppliers
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Polyhedral study of simple plant location problem with order
- Randomized local search for the discrete competitive facility location problem
- Recent insights in Huff-like competitive facility location and design
- Sequential competitive location on networks
- Sequential location problems
- The leader-follower location model
- The Mixed Integer Linear Bilevel Programming Problem
- Voronoi Games on Cycle Graphs
Cited in
(12)- Exact method for the capacitated competitive facility location problem
- Cut generation algorithm for the discrete competitive facility location problem
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- -Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution
- A cut generation algorithm of finding an optimal solution in a market competition
- Bilevel optimization: theory, algorithms, applications and a bibliography
- scientific article; zbMATH DE number 7656027 (Why is no real title available?)
- Upper bound for the competitive facility location problem with demand uncertainty
- Sequential Competitive Facility Location: Exact and Approximate Algorithms
- Additional constraints for dynamic competitive facility location problem
- A branch, bound, and cuts algorithm for the dynamic competitive facility location problem
This page was built for publication: Approximation of the competitive facility location problem with MIPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1725607)
