Upper bounds for goal functions of discrete competitive facility location problems
From MaRDI portal
Publication:3115693
zbMATH Open1249.90095MaRDI QIDQ3115693FDOQ3115693
Authors: V. L. Beresnev 
Publication date: 10 February 2012
Recommendations
- scientific article; zbMATH DE number 6006831
- Facility location in unfair competition
- Branch-and-bound algorithm for a competitive facility location problem
- Approximate algorithms for the competitive facility location problem
- On the competitive facility location problem with a free choice of suppliers
Cited In (17)
- Facility location in unfair competition
- Bilevel competitive facility location and pricing problems
- On the competitive facility location problem with a free choice of suppliers
- Upper Bound for the Competitive Facility Location Problem with Quantile Criterion
- A capacitated competitive facility location problem
- Exact method for the capacitated competitive facility location problem
- Title not available (Why is that?)
- Discrete competitive facility location: modeling and optimization approaches
- Locating facilities in a competitive environment
- Upper bound for the capacitated competitive facility location problem
- Computational complexity of the discrete competitive facility location problem
- Branch-and-bound algorithm for a competitive facility location problem
- Integer programming formulations for three sequential discrete competitive location problems with foresight
- Competitive facility location models
- Approximate algorithms for the competitive facility location problem
- Local search algorithms for the problem of competitive location of enterprises
- On the two-stage problem of linear stochastic programming with quantile criterion and discrete distribution of the random parameters
This page was built for publication: Upper bounds for goal functions of discrete competitive facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115693)
