A Fast Tabu Search Algorithm for the Reliable P-Median Problem
From MaRDI portal
Publication:2942500
DOI10.1007/978-3-319-08377-3_41zbMath1327.90032OpenAlexW210669725MaRDI QIDQ2942500
Publication date: 11 September 2015
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-08377-3_41
Integer programming (90C10) Stochastic network models in operations research (90B15) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Reliable facility location design under disruptions
- An efficient tabu search procedure for the \(p\)-median problem
- Optimal location of facilities on a network with an unreliable node or link
- Reliable Facility Location Design Under the Risk of Disruptions
- A facility reliability problem: Formulation, properties, and algorithm
This page was built for publication: A Fast Tabu Search Algorithm for the Reliable P-Median Problem