Upper bound for the competitive facility location problem with demand uncertainty

DOI10.1134/s1064562423600318OpenAlexW4392796445MaRDI QIDQ6194427

Andrey Melnikov, Vladimir Beresnev

Publication date: 19 March 2024

Published in: Doklady Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

bilevel programmingStackelberg gamecompetitive facility locationpessimistic optimal solution

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Game theory (91Axx) Operations research and management science (90Bxx)

Cites Work

• Cut generation algorithm for the discrete competitive facility location problem
• Approximation of the competitive facility location problem with MIPs
• Bilevel Models on the Competitive Facility Location Problem
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
• Modeling Discrete Competitive Facility Location

This page was built for publication: Upper bound for the competitive facility location problem with demand uncertainty