A capacitated competitive facility location problem

DOI10.1134/S1990478916010075zbMath1349.90556MaRDI QIDQ3186853

Andrey Melnikov, Vladimir Beresnev

Publication date: 12 August 2016

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

zbMATH Keywords

upper boundbilevel programmingcompetitive facility location

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (2)

Exact method for the capacitated competitive facility location problem ⋮ An upper bound for the competitive location and capacity choice problem with multiple demand scenarios

Cites Work

• Branch-and-bound algorithm for a competitive facility location problem
• On the competitive facility location problem with a free choice of suppliers
• Randomized local search for the discrete competitive facility location problem
• Foundations of bilevel programming
• The simple plant location problem: Survey and synthesis
• Local search algorithms for the problem of competitive location of enterprises
• Competitive facility location models
• The pricing problem. Part I: Exact and approximate algorithms
• The pricing problem. Part II: Computational complexity
• The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers
• Pseudo-Boolean Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A capacitated competitive facility location problem