Branch-and-cut approach based on generalized benders decomposition for facility location with limited choice rule
Published 2020 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Branch-and-cut approach based on generalized benders decomposition for facility location with limited choice rule
Authors
Keywords
Combinatorial optimization, Competitive facility location, Consideration set, Discrete choice model, Generalized Benders decomposition
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume -, Issue -, Pages -
Publisher
Elsevier BV
Online
2020-12-17
DOI
10.1016/j.ejor.2020.12.017
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- A multicut outer-approximation approach for competitive facility location under random utilities
- (2020) Tien Mai et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Exact approaches for competitive facility location with discrete attractiveness
- (2020) Yun Hui Lin et al. Optimization Letters
- Last-mile delivery: Optimal locker location under multinomial logit choice model
- (2020) Yun Hui Lin et al. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
- Integer programming formulations for three sequential discrete competitive location problems with foresight
- (2018) José Gentile et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- (2018) Ivana Ljubić et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Competitive facility location with random attractiveness
- (2018) Tammy Drezner et al. OPERATIONS RESEARCH LETTERS
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- (2018) Jean-François Cordeau et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- The Benders decomposition algorithm: A literature review
- (2017) Ragheb Rahmaniani et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Redesigning Benders Decomposition for Large-Scale Facility Location
- (2017) Matteo Fischetti et al. MANAGEMENT SCIENCE
- Benders Decomposition for the Design of a Hub and Shuttle Public Transit System
- (2017) Arthur Mahéo et al. TRANSPORTATION SCIENCE
- A branch-and-bound algorithm for the maximum capture problem with random utilities
- (2016) Alexandre S. Freire et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Benders decomposition without separability: A computational study for capacitated facility location problems
- (2016) Matteo Fischetti et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Fractional 0–1 programming: applications and algorithms
- (2016) Juan S. Borrero et al. JOURNAL OF GLOBAL OPTIMIZATION
- Models and algorithms for competitive facility location problems with different customer behavior
- (2015) Benjamin Biesinger et al. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
- Improving solution of discrete competitive facility location problems
- (2015) Algirdas Lančinskas et al. Optimization Letters
- A comparison of linear reformulations for multinomial logit choice probabilities in facility location models
- (2013) Knut Haase et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A leader–follower game in competitive facility location
- (2011) Hande Küçükaydın et al. COMPUTERS & OPERATIONS RESEARCH
- A discrete competitive facility location model with variable attractiveness
- (2011) H Küçükaydın et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- Exact approaches to the single-source network loading problem
- (2011) Ivana Ljubić et al. NETWORKS
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- (2011) Ivan Contreras et al. OPERATIONS RESEARCH
- Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution
- (2010) Hande Küçükaydin et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreFind the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
Search