An upper bound for the competitive location and capacity choice problem with multiple demand scenarios

DOI10.1134/S1990478917040020zbMath1399.90194OpenAlexW2769316809MaRDI QIDQ5374006

Andrey Melnikov, Vladimir Beresnev

Publication date: 6 April 2018

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

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

zbMATH Keywords

upper boundbilevel programmingcompetitive facility location

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Noncooperative games (91A10) Applications of game theory (91A80) Management decision making, including multiple objectives (90B50) Discrete location and assignment (90B80)

Cites Work

• Branch-and-bound algorithm for a competitive facility location problem
• A local search heuristic for the \((r| p)\)-centroid problem in the plane
• A leader-follower model for discrete competitive facility location
• On the competitive facility location problem with a free choice of suppliers
• Randomized local search for the discrete competitive facility location problem
• Sequential location problems
• Foundations of bilevel programming
• Strategic facility location, capacity acquisition, and technology choice decisions under demand uncertainty: robust vs. non-robust optimization approaches
• A capacitated competitive facility location problem
• Modeling Discrete Competitive Facility Location