Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
type: Item
instance of: scholarly article
title: Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
zbMATH Open document ID: 1487.90442
author: Yun Hui Lin
author: Qingyun Tian
published in: European Journal of Operational Research
publication date: 2021-06-07T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 7356011
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: competitive facility location
zbMATH Keywords: consideration set
zbMATH Keywords: discrete choice model
zbMATH Keywords: generalized Benders decomposition
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.12.017
OpenAlex ID: W3112830585
cites work: Competitive facility location and design problem
cites work: A duality theorem and an algorithm for (mixed-) integer nonlinear programming
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: The maximum capture problem with random utilities: problem formulation and algorithms
cites work: Models and algorithms for competitive facility location problems with different customer behavior
cites work: Fractional 0-1 programming: applications and algorithms
cites work: Benders decomposition for large-scale uncapacitated hub location
cites work: Benders decomposition for very large scale partial set covering and maximal covering location problems
cites work: Derived attractiveness of shopping malls
cites work: Validating the gravity-based competitive location model using inferred attractiveness
cites work: Solving the multiple competitive facilities location problem
cites work: Competitive facility location with random attractiveness
cites work: General Luce model
cites work: Solving a huff-like competitive location and design model for profit maximization in the plane
cites work: New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
cites work: Benders decomposition without separability: a computational study for capacitated facility location problems
cites work: A branch-and-bound algorithm for the maximum capture problem with random utilities
cites work: Integer programming formulations for three sequential discrete competitive location problems with foresight
cites work: A comparison of linear reformulations for multinomial logit choice probabilities in facility location models
cites work: Q3971522
cites work: Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
cites work: A leader-follower game in competitive facility location
cites work: Improving solution of discrete competitive facility location problems
cites work: Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
cites work: Exact approaches to the single-source network loading problem
cites work: Q3270181
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: A multicut outer-approximation approach for competitive facility location under random utilities
cites work: The Benders decomposition algorithm: a literature review
DOI: 10.1016/J.EJOR.2020.12.017
Recommended article: Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
Recommended article: A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
Recommended article: Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
Recommended article: The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers
Recommended article: A Benders decomposition method for dynamic facility location in integrated closed chain problem
Recommended article: Q3115726
Recommended article: Q4242550
Recommended article: A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions
Recommended article: Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness
description: scientific article; zbMATH DE number 7356011