Finding the optimal solution to the Huff based competitive location model
From MaRDI portal
Publication:2386632
DOI10.1007/S10287-004-0009-6zbMATH Open1115.90357OpenAlexW2033188173MaRDI QIDQ2386632FDOQ2386632
Authors: Tammy Drezner, Zvi Drezner 
Publication date: 25 August 2005
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-004-0009-6
Recommendations
- Solving a huff-like competitive location and design model for profit maximization in the plane
- A robust and efficient algorithm for planar competitive location problems
- Solving the Huff-based competitive location model on a network with link-based demand
- Discretization results for the Huff and Pareto-Huff competitive location models on networks
- Single-facility huff location problems on networks
Cited In (46)
- Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane
- Solving multifacility Huff location models on networks using variable neighborhood search and multi-start local search metaheuristics
- The obnoxious competitive facility location model
- A refinement of the gravity model for competitive facility location
- Competitive location models: a review
- Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
- Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players
- A GIS-based optimization framework for competitive multi-facility location-routing problem
- Estimating the Pareto front of a hard bi-criterion competitive facility location problem
- Optimizing the location of a production firm
- On minimax-regret Huff location models
- Generalized coverage: new developments in covering location models
- On the convergence of the generalized Weiszfeld algorithm
- Multipurpose shopping trips and location
- Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule
- Facility dependent distance decay in competitive location
- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
- Extensions to the Weber problem
- Equity models in planar location
- A discrete competitive facility location model with proportional and binary rules sequentially applied
- Solving multifacility Huff location models on networks using metaheuristic and exact approaches
- \(p\)-facility Huff location problem on networks
- Single-facility huff location problems on networks
- The Weiszfeld Algorithm: Proof, Amendments, and Extensions
- On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems
- Extensions to competitive facility location with multi-purpose trips
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
- Continuous location problems and big triangle small triangle: Constructing better bounds
- The attractive traveling salesman problem
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution
- The use of fuzzy logic in various combinatorial optimization problems
- A continuum perspective of customer choice rules for competitive facility location problems
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
- A robust and efficient algorithm for planar competitive location problems
- Location with acceleration-deceleration distance
- A general global optimization approach for solving location problems in the plane
- On a branch-and-bound approach for a Huff-like Stackelberg location problem
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Competitive facility location under attrition
- Solving the Huff-based competitive location model on a network with link-based demand
- Robust model of discrete competitive facility location problem with partially proportional rule
- Maximizing the minimum cover probability by emergency facilities
- Profit maximization and reduction of the cannibalization effect in chain expansion
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- Location of retail facilities under conditions of uncertainty
- A stochastic gradual cover location problem
This page was built for publication: Finding the optimal solution to the Huff based competitive location model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386632)
