Facility dispersion problems under capacity and cost constraints

DOI10.1023/A:1009802105661zbMath0961.90091OpenAlexW1534783476MaRDI QIDQ1977861

Daniel J. Rosenkrantz, S. S. Ravi, Giri Kumar Tayi

Publication date: 5 June 2000

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009802105661

zbMATH Keywords

optimizationdispersionpolynomial algorithmstorage capacityapproximation schemestorage cost

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (8)

An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs ⋮ Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS ⋮ A review on discrete diversity and dispersion maximization from an OR perspective ⋮ Heuristics for the capacitated dispersion problem ⋮ A linear time approximation scheme for computing geometric maximum \(k\)-star ⋮ Formulations and valid inequalities for the capacitated dispersion problem ⋮ Powers of geometric intersection graphs and dispersion algorithms ⋮ Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs

This page was built for publication: Facility dispersion problems under capacity and cost constraints