Branch-and-bound algorithm for a competitive facility location problem
From MaRDI portal
Recommendations
- The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers
- On the competitive facility location problem with a free choice of suppliers
- A capacitated competitive facility location problem
- Upper bounds for goal functions of discrete competitive facility location problems
- Approximate algorithms for the competitive facility location problem
Cites work
- An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness property
- An exact procedure and LP formulations for the leader-follower location problem
- Branch-and-Bound Methods: General Formulation and Properties
- Competitive Location on a Network
- Foundations of bilevel programming
- scientific article; zbMATH DE number 9247 (Why is no real title available?)
- Multiple voting location problems
- Pseudo-Boolean Programming
- The simple plant location problem: Survey and synthesis
Cited in
(29)- A robust and efficient algorithm for planar competitive location problems
- A variational inequality formulation for designing a multi-echelon, multi-product supply chain network in a competitive environment
- Exact method for the capacitated competitive facility location problem
- Cut generation algorithm for the discrete competitive facility location problem
- Cournot-Stackelberg games in competitive delocation
- Approximation of the competitive facility location problem with MIPs
- Local search algorithms for the problem of competitive location of enterprises
- -Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
- Locating facilities in a competitive environment
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution
- A study on the use of heuristics to solve a bilevel programming problem
- A mathematical model of market competition
- Approximate algorithms for the competitive facility location problem
- Upper bounds for goal functions of discrete competitive facility location problems
- A capacitated competitive facility location problem
- A local search heuristic for the \((r| p)\)-centroid problem in the plane
- Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems
- On the competitive facility location problem with a free choice of suppliers
- A cut generation algorithm of finding an optimal solution in a market competition
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Competitive Facility Location with Selfish Users and Queues
- 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
- Discrete competitive facility location: modeling and optimization approaches
- An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
- scientific article; zbMATH DE number 7656027 (Why is no real title available?)
- Bilevel competitive facility location and design under a nested logit model
- An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
- A branch-and-price algorithm for the capacitated facility location problem
This page was built for publication: Branch-and-bound algorithm for a competitive facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336436)
