Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem
From MaRDI portal
Cites work
- A bilevel model of taxation and its application to optimal highway pricing
- 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
- A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem
- A leader-follower game in competitive facility location
- A leader-follower model for discrete competitive facility location
- A new alternating heuristic for the \((r|p)\)-centroid problem on the plane
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A survey on mixed-integer programming techniques in bilevel optimization
- An approximation algorithm for a competitive facility location problem with network effects
- An exact method for the discrete \((r|p)\)-centroid problem
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
- Bilevel models on the competitive facility location problem
- Budget constrained location problem with opening and closing of facilities.
- Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study
- Competitive facility location and design problem
- Competitive facility location with random attractiveness
- Contributions to location analysis. In honor of Zvi Drezner's 75th birthday
- Cournot-Stackelberg games in competitive delocation
- Exact method for the capacitated competitive facility location problem
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem
- Gradual cover competitive facility location
- scientific article; zbMATH DE number 35514 (Why is no real title available?)
- Improving solution of discrete competitive facility location problems
- Locating and sizing bank-branches by opening, closing or maintaining facilities
- Locating facilities in a competitive environment
- Location science
- Metaheuristic methods for solving the bilevel uncapacitated facility location problem with clients' preferences
- Modeling Discrete Competitive Facility Location
- Models and algorithms for competitive facility location problems with different customer behavior
- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
- On locating new facilities in a competitive environment
- On the complexity of the \((r|p)\)-centroid problem in the plane
- On the use of intersection cuts for bilevel optimization
- Optimal shrinking of the distribution chain: the facilities delocation decision
- Optimization of competitive facility location for chain stores
- Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems
- Restructuring bank networks after mergers and acquisitions: a capacitated delocation model for closing and resizing branches
- Solving a dynamic facility location problem with partial closing and reopening
- The polynomial hierarchy and a simple model for competitive analysis
- The stochastic capacitated branch restructuring problem
Cited in
(3)
This page was built for publication: Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6065606)
