Computational complexity of the discrete competitive facility location problem

DOI10.1134/S1990478914040139zbMath1324.90108OpenAlexW1974407940MaRDI QIDQ5264752

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

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

Related Items (4)

Stochastic problem of competitive location of facilities with quantile criterion ⋮ Exact method for the capacitated competitive facility location problem ⋮ Approximation of the competitive facility location problem with MIPs ⋮ Discrete Competitive Facility Location: Modeling and Optimization Approaches

Cites Work

• Branch-and-bound algorithm for a competitive facility location problem
• On the complexity of the \((r|p)\)-centroid problem in the plane
• The polynomial-time hierarchy
• Foundations of bilevel programming
• The simple plant location problem: Survey and synthesis
• Local search algorithms for the problem of competitive location of enterprises
• A strengthened formulation for the simple plant location problem with order
• Competitive facility location models
• New lower bounds for the facility location problem with clients’ preferences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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