Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
From MaRDI portal
Publication:2253481
DOI10.1016/j.ejor.2012.09.041zbMath1292.90159OpenAlexW1963500995MaRDI QIDQ2253481
Publication date: 27 July 2014
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.09.041
Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Related Items (8)
A scalable exact algorithm for the vertex \(p\)-center problem ⋮ The multi-period \(p\)-center problem with time-dependent travel times ⋮ GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem ⋮ Exact solution approaches for the discrete α‐neighbor p‐center problem ⋮ Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane ⋮ The stratified \(p\)-center problem ⋮ An elliptical cover problem in drone delivery network design and its solution algorithms ⋮ Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
Uses Software
This page was built for publication: Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
