Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem
From MaRDI portal
Publication:6065606
DOI10.1016/j.cor.2023.106418MaRDI QIDQ6065606
Juan A. Díaz, José-Fernando Camacho-Vallejo, Diego Ruiz-Hernández, Juan-Carlos García-Vélez
Publication date: 15 November 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Models and algorithms for competitive facility location problems with different customer behavior
- Restructuring bank networks after mergers and acquisitions: a capacitated delocation model for closing and resizing branches
- A leader-follower model for discrete competitive facility location
- Solving a dynamic facility location problem with partial closing and reopening
- On the complexity of the \((r|p)\)-centroid problem in the plane
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem
- The stochastic capacitated branch restructuring problem
- A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem
- Improving solution of discrete competitive facility location problems
- Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study
- Competitive facility location and design problem
- An exact method for the discrete \((r|p)\)-centroid problem
- On locating new facilities in a competitive environment
- Budget constrained location problem with opening and closing of facilities.
- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
- Exact method for the capacitated competitive facility location problem
- Cournot-Stackelberg games in competitive delocation
- Optimization of competitive facility location for chain stores
- An approximation algorithm for a competitive facility location problem with network effects
- A leader-follower game in competitive facility location
- On the use of intersection cuts for bilevel optimization
- Gradual cover competitive facility location
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
- Locating facilities in a competitive environment
- Competitive facility location with random attractiveness
- Contributions to location analysis. In honor of Zvi Drezner's 75th birthday
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences
- Bilevel Models on the Competitive Facility Location Problem
- Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems
- The polynomial hierarchy and a simple model for competitive analysis
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- Location Science
- A new alternating heuristic for the (r | p)–centroid problem on the plane
- Modeling Discrete Competitive Facility Location
- Optimal shrinking of the distribution chain: the facilities delocation decision
- A survey on mixed-integer programming techniques in bilevel optimization
This page was built for publication: Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem