Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
From MaRDI portal
Publication:2030506
DOI10.1016/j.ejor.2020.12.017zbMath1487.90442OpenAlexW3112830585MaRDI QIDQ2030506
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.12.017
combinatorial optimizationgeneralized Benders decompositioncompetitive facility locationdiscrete choice modelconsideration set
Related Items (9)
A supervised learning-driven heuristic for solving the facility location and production planning problem ⋮ Joint location and cost planning in maximum capture facility location under random utilities ⋮ Revisiting Stackelberg p-median problem with user preferences ⋮ Sequential customers' decisions in facility location with comparison-shopping ⋮ Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut ⋮ Winner determination with sustainable-flexible considerations under demand uncertainty in transportation service procurement auctions ⋮ The follower competitive facility location problem under the nested logit choice rule ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Models and algorithms for competitive facility location problems with different customer behavior
- A branch-and-bound algorithm for the maximum capture problem with random utilities
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Improving solution of discrete competitive facility location problems
- Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Competitive facility location and design problem
- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
- Fractional 0-1 programming: applications and algorithms
- Integer programming formulations for three sequential discrete competitive location problems with foresight
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- The Benders decomposition algorithm: a literature review
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- A leader-follower game in competitive facility location
- Solving the multiple competitive facilities location problem
- The maximum capture problem with random utilities: problem formulation and algorithms
- Validating the gravity-based competitive location model using inferred attractiveness
- A multicut outer-approximation approach for competitive facility location under random utilities
- A comparison of linear reformulations for multinomial logit choice probabilities in facility location models
- General Luce model
- Competitive facility location with random attractiveness
- A duality theorem and an algorithm for (mixed-) integer nonlinear programming
- Lectures on Modern Convex Optimization
- Exact approaches to the single-source network loading problem
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Derived attractiveness of shopping malls
This page was built for publication: Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
