Computational complexity of the discrete competitive facility location problem

DOI10.1134/S1990478914040139MaRDI QIDQ5264752zbMATH OpenOpenAlexFDO

Authors Andrey Melnikov

Publication date 27 July 2015

Published in Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1990478914040139

zbMATH Keywords

bilevel programmingpolynomial hierarchyStackelberg game

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Noncooperative games (91A10)

Recommendations

• scientific article; zbMATH DE number 6006831
• Competitive facility location models
• Discrete competitive facility location: modeling and optimization approaches
• Randomized local search for the discrete competitive facility location problem
• Approximate algorithms for the competitive facility location problem

Cites work

• A strengthened formulation for the simple plant location problem with order
• Approximate algorithms for the competitive facility location problem
• Branch-and-bound algorithm for a competitive facility location problem
• Competitive facility location models
• Foundations of bilevel programming
• scientific article; zbMATH DE number 3936965 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Local search algorithms for the problem of competitive location of enterprises
• Local search over a generalized neighborhood for an optimization problem of pseudo-Boolean functions
• New lower bounds for the facility location problem with clients' preferences
• On the complexity of the \((r|p)\)-centroid problem in the plane
• The branch and cut method for the facility location problem with client's preferences
• The polynomial-time hierarchy
• The simple plant location problem: Survey and synthesis
• Upper bounds for goal functions of discrete competitive facility location problems

Cited in

(7)

• Exact method for the capacitated competitive facility location problem
• Approximation of the competitive facility location problem with MIPs
• scientific article; zbMATH DE number 6006831 (Why is no real title available?)
• Stochastic problem of competitive location of facilities with quantile criterion
• Randomized local search for the discrete competitive facility location problem
• scientific article; zbMATH DE number 1822170 (Why is no real title available?)
• Discrete competitive facility location: modeling and optimization approaches

This page was built for publication: Computational complexity of the discrete competitive facility location problem

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