A multicut outer-approximation approach for competitive facility location under random utilities
From MaRDI portal
Publication:2178115
DOI10.1016/j.ejor.2020.01.020zbMath1441.90084OpenAlexW2999769590WikidataQ126337740 ScholiaQ126337740MaRDI QIDQ2178115
Publication date: 7 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://ink.library.smu.edu.sg/sis_research/5283
facilities planning and designmaximum capturemultinomial logitmixed multinomial logitmulticut outer-approximation
Related Items (14)
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 ⋮ Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster ⋮ Stable allocations for choice-based collaborative price setting ⋮ Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution ⋮ 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 ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- A branch-and-bound algorithm for the maximum capture problem with random utilities
- The impact of client choice on preventive healthcare facility network design
- An algorithmic framework for convex mixed integer nonlinear programs
- A multicut algorithm for two-stage stochastic linear programs
- A note on a global approach for general 0-1 fractional programming
- 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
- 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
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Discrete Choice Methods with Simulation
This page was built for publication: A multicut outer-approximation approach for competitive facility location under random utilities
