On the approximation of the minimum disturbance \(p\)-facility location problem

DOI10.1016/S0166-218X(01)00257-8zbMath1010.90033OpenAlexW2132689652MaRDI QIDQ1348254

Giulia Galbiati

Publication date: 15 May 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00257-8

zbMATH Keywords

heuristicsapproximation algorithmsrandomized algorithmsdiscrete location theory

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Randomized algorithms (68W20)

Related Items (1)

Discrete facility location and routing of obnoxious activities.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Lectures on proof verification and approximation algorithms
• Discrete facility location and routing of obnoxious activities.
• Dynamic facility location: The progressive p-median problem

This page was built for publication: On the approximation of the minimum disturbance \(p\)-facility location problem