Approximate algorithms for the competitive facility location problem

zbMATH Open1249.90138MaRDI QIDQ3115237FDOQ3115237

Authors: Andrey Melnikov, V. L. Beresnev 

Publication date: 20 February 2012

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

zbMATH Keywords

local searchapproximate solutionupper boundbi-level programming problemoptimal noncooperative solution

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cited In (13)

• PARALLEL OPTIMIZATION ALGORITHM FOR COMPETITIVE FACILITY LOCATION
• Approximation of the competitive facility location problem with MIPs
• Bilevel competitive facility location and pricing problems
• A capacitated competitive facility location problem
• Title not available (Why is that?)
• Competitive facility location problem. An algorithm for the problem concerning the existence of multi-type customers
• Efficient algorithms for the capacitated concentrator location problem
• Computational complexity of the discrete competitive facility location problem
• Stochastic problem of competitive location of facilities with quantile criterion
• 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)