VNS heuristic for the –centroid problem on the plane
From MaRDI portal
Publication:2840744
DOI10.1016/j.endm.2012.10.002zbMath1268.90139OpenAlexW2097343235MaRDI QIDQ2840744
No author found.
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/107141
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A bilevel planning model for public-private partnership ⋮ A local search heuristic for the \((r| p)\)-centroid problem in the plane ⋮ An exact method for the discrete \((r|p)\)-centroid problem ⋮ Metaheuristics for bilevel optimization: a comprehensive review ⋮ Comparison of models of planning public-private partnership ⋮ A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem ⋮ VNS
Cites Work
- Sequential competitive location on networks
- On the complexity of the \((r|p)\)-centroid problem in the plane
- On locating new facilities in a competitive environment
- An alternating heuristic for medianoid and centroid problems in the plane
- A new alternating heuristic for the (r | p)–centroid problem on the plane
- Variable neighborhood search: Principles and applications
