Solving the multiple competitive facilities location problem
From MaRDI portal
Publication:1847246
DOI10.1016/S0377-2217(01)00168-0zbMath1081.90575MaRDI QIDQ1847246
Tammy Drezner, Said Salhi, Zvi Drezner
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (27)
Exact approaches for competitive facility location with discrete attractiveness ⋮ Covering part of a planar network ⋮ Constrained location of competitive facilities in the plane ⋮ Solving a location problem of a Stackelberg firm competing with Cournot-Nash firms ⋮ \(p\)-facility Huff location problem on networks ⋮ A new heuristic for solving the \(p\)-median problem in the plane ⋮ Equity models in planar location ⋮ Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness ⋮ Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure ⋮ An approximation algorithm for the location of dairy enterprises under time constraints ⋮ Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution ⋮ Multipurpose shopping trips and location ⋮ A Mathematical Programming Model with Equilibrium Constraints for Competitive Closed-Loop Supply Chain Network Design ⋮ A refinement of the gravity model for competitive facility location ⋮ Extensions to the planar \(p\)-median problem ⋮ Cournot-Stackelberg games in competitive delocation ⋮ Designing a supply chain network under the risk of disruptions ⋮ An approach for solving competitive location problems with variable demand using multicore systems ⋮ A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem ⋮ Multi-outlet retail site location assessment ⋮ Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models ⋮ Strategic design of competing supply chain networks with foresight ⋮ A generalized Weiszfeld method for the multi-facility location problem ⋮ Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule ⋮ A robust and efficient algorithm for planar competitive location problems ⋮ Efficient solution approaches for a discrete multi-facility competitive interaction model ⋮ Conditional Location Problems on Networks and in the Plane
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Equity models in planar location
- On locating new facilities in a competitive environment
- A tabu search approach for the resource constrained project scheduling problem
- A study of diversification strategies for the quadratic assignment problem
- Simulated annealing and genetic algorithms for the facility layout problem: A survey
- Technical Note—Conditional Location Problems on Networks
- Conditional p-Center Problems
- Replacing continuous demand with discrete demand in a competitive location model
- Defining tabu list size and aspiration criterion within tabu search methods
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving the multiple competitive facilities location problem
