Finding the optimal solution to the Huff based competitive location model
From MaRDI portal
Publication:2386632
DOI10.1007/s10287-004-0009-6zbMath1115.90357OpenAlexW2033188173MaRDI QIDQ2386632
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
Related Items (40)
Extensions to the Weber problem ⋮ \(p\)-facility Huff location problem on networks ⋮ New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior ⋮ Equity models in planar location ⋮ Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure ⋮ The theoretical and empirical rate of convergence for geometric branch-and-bound methods ⋮ A discrete competitive facility location model with proportional and binary rules sequentially applied ⋮ Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution ⋮ Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players ⋮ Competitive facility location under attrition ⋮ Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution ⋮ Multipurpose shopping trips and location ⋮ Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem ⋮ The obnoxious competitive facility location model ⋮ A refinement of the gravity model for competitive facility location ⋮ A continuum perspective of customer choice rules for competitive facility location problems ⋮ Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule ⋮ Single-facility huff location problems on networks ⋮ A stochastic gradual cover location problem ⋮ Profit maximization and reduction of the cannibalization effect in chain expansion ⋮ Maximizing the minimum cover probability by emergency facilities ⋮ Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models ⋮ Generalized coverage: new developments in covering location models ⋮ On minimax-regret Huff location models ⋮ Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane ⋮ Optimizing the location of a production firm ⋮ A GIS-based optimization framework for competitive multi-facility location-routing problem ⋮ Facility dependent distance decay in competitive location ⋮ A general global optimization approach for solving location problems in the plane ⋮ A robust and efficient algorithm for planar competitive location problems ⋮ Location of retail facilities under conditions of uncertainty ⋮ On the convergence of the generalized Weiszfeld algorithm ⋮ Location with acceleration-deceleration distance ⋮ On a branch-and-bound approach for a Huff-like Stackelberg location problem ⋮ On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems ⋮ Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees ⋮ Continuous location problems and big triangle small triangle: Constructing better bounds ⋮ The attractive traveling salesman problem ⋮ The use of fuzzy logic in various combinatorial optimization problems ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions
This page was built for publication: Finding the optimal solution to the Huff based competitive location model
