A branch-and-bound algorithm for the maximum capture problem with random utilities
From MaRDI portal
(Redirected from Publication:322866)
Recommendations
- The maximum capture problem with random utilities: problem formulation and algorithms
- A multicut outer-approximation approach for competitive facility location under random utilities
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Submodularity and local search approaches for maximum capture problems under generalized extreme value models
- The maximum capture problem with heterogeneous customers
Cites work
- A class of globally convergent optimization methods based on conservative convex separable approximations
- A comparison of linear reformulations for multinomial logit choice probabilities in facility location models
- Benchmarking optimization software with performance profiles.
- scientific article; zbMATH DE number 1803758 (Why is no real title available?)
- Insights into clients' choice in preventive health care facility location planning
- On locating new facilities in a competitive environment
- P-hub approach for the optimal park-and-ride facility location problem
- The impact of client choice on preventive healthcare facility network design
- The maximum capture problem with random utilities: problem formulation and algorithms
Cited in
(21)- A new chance-constrained maximum capture location problem
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- The maximum capture problem with heterogeneous customers
- 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
- Distributionally robust facility location problem under decision-dependent stochastic demand
- 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
- Customer allocation in maximum capture problems
- On the linear integration of attraction choice models in business optimization problems
- 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
- A Huff-like location model with quality adjustment and/or closing of existing facilities
- Maximum capture location problem with random utilities and overflow penalties
- A choice-based approach to dynamic capacitated multi-item lot sizing with demand uncertainty
- An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
This page was built for publication: A branch-and-bound algorithm for the maximum capture problem with random utilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322866)
