On the competitive facility location problem with a free choice of suppliers
From MaRDI portal
Publication:463373
Recommendations
- Branch-and-bound algorithm for a competitive facility location problem
- A capacitated competitive facility location problem
- Upper bounds for goal functions of discrete competitive facility location problems
- The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers
- Competitive facility location models
Cites work
- Branch-and-bound algorithm for a competitive facility location problem
- Competitive facility location models
- Foundations of bilevel programming
- Local search algorithms for the problem of competitive location of enterprises
- Pseudo-Boolean Programming
- The pricing problem. I: Exact and approximate algorithms
- The pricing problem. Part II: Computational complexity
- The simple plant location problem: Survey and synthesis
Cited in
(20)- A bilevel planning model for public-private partnership
- Facility location in unfair competition
- An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
- Upper bounds for goal functions of discrete competitive facility location problems
- Additional constraints for dynamic competitive facility location problem
- Approximation of the competitive facility location problem with MIPs
- A capacitated competitive facility location problem
- Local search algorithms for the problem of competitive location of enterprises
- scientific article; zbMATH DE number 7656027 (Why is no real title available?)
- scientific article; zbMATH DE number 5991640 (Why is no real title available?)
- Competitive facility location models
- A mathematical model of market competition
- The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers
- Exact method for the capacitated competitive facility location problem
- A cut generation algorithm of finding an optimal solution in a market competition
- Branch-and-bound algorithm for a competitive facility location problem
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
- Sequential discrete \(p\)-facility models for competitive location planning
- An approximation algorithm for a competitive facility location problem with network effects
- Discrete competitive facility location: modeling and optimization approaches
This page was built for publication: On the competitive facility location problem with a free choice of suppliers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463373)
