On a branch-and-bound approach for a Huff-like Stackelberg location problem

DOI10.1007/s00291-008-0133-8zbMath1163.90619OpenAlexW2077693928MaRDI QIDQ1027988

Blas Pelegrín, M. Elena Sáiz, José Fernández, Eligius M. T. Hendrix

Publication date: 30 June 2009

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-008-0133-8

zbMATH Keywords

continuous locationnonlinear programmingglobal optimisation algorithmsStackelberg competitive location

Mathematics Subject Classification ID

Continuous location (90B85) Nonlinear programming (90C30) Applications of game theory (91A80)

Related Items (19)

Exact approaches for competitive facility location with discrete attractiveness ⋮ Chaotic dynamics in nonlinear duopoly Stackelberg game with heterogeneous players ⋮ Exact method for the capacitated competitive facility location problem ⋮ A leader-follower model for discrete competitive facility location ⋮ A robust model for a leader-follower competitive facility location problem in a discrete space ⋮ Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness ⋮ Competitive facility location with random attractiveness ⋮ Competitive facility location under attrition ⋮ Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution ⋮ A kernel search matheuristic to solve the discrete leader-follower location problem ⋮ On competition in a Stackelberg location-design model with deterministic supplier choice ⋮ On agglomeration in competitive location models ⋮ A leader-follower game in competitive facility location ⋮ On Nash equilibria of a competitive location-design problem ⋮ Solving a Huff-like Stackelberg location problem on networks ⋮ \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario ⋮ A minimax regret model for the leader-follower facility location problem ⋮ ON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCE ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• Solving a huff-like competitive location and design model for profit maximization in the plane
• Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
• On locating new facilities in a competitive environment
• GBSSS: The generalized big square small square method for planar single- facility location
• Sequential location problems
• An alternating heuristic for medianoid and centroid problems in the plane
• Optimal location and design of a competitive facility
• A d.c. optimization method for single facility location problems
• Finding the optimal solution to the Huff based competitive location model
• Theoretical comparisons of search strategies in branch-and-bound algorithms
• Replacing continuous demand with discrete demand in a competitive location model
• Competitive Location Models: A Framework and Bibliography
• Branch-and-Bound Methods: General Formulation and Properties
• Static competitive facility location: an overview of optimisation approaches.

This page was built for publication: On a branch-and-bound approach for a Huff-like Stackelberg location problem