Approximate algorithms for the competitive facility location problem

MaRDI QIDQ3115237zbMATH OpenFDO

Authors Andrey Melnikov, V. L. Beresnev

Publication date 20 February 2012

zbMATH Keywords

local searchapproximate solutionupper boundbi-level programming problemoptimal noncooperative solution

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 6006831
• Upper bounds for goal functions of discrete competitive facility location problems
• Branch-and-bound algorithm for a competitive facility location problem
• 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

Cited in

(21)

• Approximation of the competitive facility location problem with MIPs
• PARALLEL OPTIMIZATION ALGORITHM FOR COMPETITIVE FACILITY LOCATION
• Bilevel competitive facility location and pricing problems
• Randomized local search for the discrete competitive facility location problem
• Tabu search approach for the bi-level competitive base station location problem
• The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers
• A capacitated competitive facility location problem
• An approximation algorithm for a competitive facility location problem with network effects
• Upper bounds for goal functions of discrete competitive facility location problems
• scientific article; zbMATH DE number 2159272 (Why is no real title available?)
• Competitive facility location problem. An algorithm for the problem concerning the existence of multi-type customers
• A new approach to cooperative competition in facility location problems: mathematical formulations and an approximation algorithm
• Efficient algorithms for the capacitated concentrator location problem
• Stochastic problem of competitive location of facilities with quantile criterion
• Branch-and-bound algorithm for a competitive facility location problem
• Computational complexity of the discrete competitive facility location problem
• Sequential Competitive Facility Location: Exact and Approximate Algorithms
• Solving the multiple competitive facilities location problem
• Efficient solution approaches for a discrete multi-facility competitive interaction model
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
• Local search algorithms for the problem of competitive location of enterprises

This page was built for publication: Approximate algorithms for the competitive facility location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115237)