A branch-and-bound algorithm for the maximum capture problem with random utilities
From MaRDI portal
Publication:322866
DOI10.1016/j.ejor.2015.12.026zbMath1346.90491OpenAlexW2211783957WikidataQ57707451 ScholiaQ57707451MaRDI QIDQ322866
Alexandre S. Freire, Wilfredo F. Yushimito, Eduardo Moreno
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.12.026
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items
On the linear integration of attraction choice models in business optimization problems, A multicut outer-approximation approach for competitive facility location under random utilities, Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness, A Lagrangian decomposition scheme for choice-based optimization, Joint location and cost planning in maximum capture facility location under random utilities, Sequential customers' decisions in facility location with comparison-shopping, Robust maximum capture facility location under random utility maximization models, The follower competitive facility location problem under the nested logit choice rule, Outer approximation and submodular cuts for maximum capture facility location problems with random utilities, Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule, Distributionally robust facility location problem under decision-dependent stochastic demand, Store location with multipurpose shopping trips and a new random utility customers' choice model
Cites Work
- Unnamed Item
- The impact of client choice on preventive healthcare facility network design
- On locating new facilities in a competitive environment
- The maximum capture problem with random utilities: problem formulation and algorithms
- 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
- Insights into clients' choice in preventive health care facility location planning
- A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
- Benchmarking optimization software with performance profiles.
