Upper bounds for goal functions of discrete competitive facility location problems

zbMATH Open1249.90095MaRDI QIDQ3115693FDOQ3115693

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

zbMATH Keywords

optimal solutionupper boundbilevel programming problempseudo-Boolean function

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50)

Cited In (8)

• Discrete Competitive Facility Location: Modeling and Optimization Approaches
• Upper Bound for the Competitive Facility Location Problem with Quantile Criterion
• Title not available (Why is that?)
• Locating facilities in a competitive environment
• Computational complexity of the discrete competitive facility location problem
• Competitive facility location models
• 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)