The follower competitive facility location problem under the nested logit choice rule
From MaRDI portal
Publication:6168505
DOI10.1016/j.ejor.2023.03.008OpenAlexW4323668235MaRDI QIDQ6168505
Armin Lüer-Villagra, Vladimir Marianov, Gonzalo Méndez-Vogel
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.03.008
Related Items (1)
Cites Work
- A branch-and-bound algorithm for the maximum capture problem with random utilities
- The impact of client choice on preventive healthcare facility network design
- On agglomeration in competitive location models
- Agglomeration as spatial interdependence between firms and households
- Optimizing healthcare network design under reference pricing and parameter uncertainty
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- The maximum capture problem with random utilities: problem formulation and algorithms
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
- An exact method for assortment optimization under the nested logit model
- Store location with multipurpose shopping trips and a new random utility customers' choice model
- Submodularity and local search approaches for maximum capture problems under generalized extreme value models
- A multicut outer-approximation approach for competitive facility location under random utilities
- P-hub approach for the optimal park-and-ride facility location problem
- A comparison of linear reformulations for multinomial logit choice probabilities in facility location models
- A competitive hub location and pricing problem
- Competitive location and pricing on networks with random utilities
- The leader multipurpose shopping location problem
- The Principle of Minimum Differentiation Holds under Sufficient Heterogeneity
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- An analysis of approximations for maximizing submodular set functions—I
- Tractability
This page was built for publication: The follower competitive facility location problem under the nested logit choice rule
