An alternating heuristic for medianoid and centroid problems in the plane
From MaRDI portal
Publication:1870807
DOI10.1016/S0305-0548(02)00024-2zbMath1026.90053MaRDI QIDQ1870807
H. A. Eiselt, Joy Bhadury, Jorge H. Jaramillo
Publication date: 14 May 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Models and algorithms for competitive facility location problems with different customer behavior, A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war, A local search heuristic for the \((r| p)\)-centroid problem in the plane, A two-level evolutionary algorithm for solving the facility location and design \((1|1)\)-centroid problem on the plane with variable demand, A robust model for a leader-follower competitive facility location problem in a discrete space, An exact procedure and LP formulations for the leader-follower location problem, Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution, The generalized discrete ‐centroid problem, Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution, Location Science in Canada, A kernel search matheuristic to solve the discrete leader-follower location problem, On the complexity of the \((r|p)\)-centroid problem in the plane, Bilevel competitive facility location and pricing problems, A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem, A leader-follower game in competitive facility location, Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane, Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game, On a branch-and-bound approach for a Huff-like Stackelberg location problem, ON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCE, VNS heuristic for the –centroid problem on the plane, Sequential Location Models, Conditional Location Problems on Networks and in the Plane, A leader-follower single allocation hub location problem under fixed markups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence analysis and algorithmic implications of two dynamic processes toward an oligopoly-competitive fringe equilibrium solution
- Competitive location with rectilinear distances
- On locating new facilities in a competitive environment
- Sequential location problems
- Reachability of locational Nash equilibria
- The Principle of Minimum Differentiation Reconsidered: Some New Developments in the Theory of Spatial Competition
- A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
- On Hotelling's "Stability in Competition"
- Computational Geometry in C
- Competitive Location Models: A Framework and Bibliography
