A new alternating heuristic for the (r | p)–centroid problem on the plane

DOI10.1007/978-3-642-29210-1_44zbMath1306.90176OpenAlexW60507380MaRDI QIDQ5176313

Ivan Davydov, Emilio Carrizosa, Yury A. Kochetov

Publication date: 3 March 2015

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29210-1_44

Mathematics Subject Classification ID

Applications of game theory (91A80) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (8)

Locating facilities in a competitive environment ⋮ A bilevel planning model for public-private partnership ⋮ A local search heuristic for the \((r| p)\)-centroid problem in the plane ⋮ Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem ⋮ 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 ⋮ VNS heuristic for the –centroid problem on the plane

This page was built for publication: A new alternating heuristic for the (r | p)–centroid problem on the plane