A survey on approximation algorithms for facility location problems

MaRDI QIDQ5259975zbMATH OpenFDO

Authors Dachuan Xu, Donglei Du, Chenchen Wu

Publication date 29 June 2015

zbMATH Keywords

approximation algorithmfacility location problemlinear programming roundinglocal searchprimal-dual scheme

Mathematics Subject Classification ID

Approximation algorithms (68W25) Discrete location and assignment (90B80) Linear programming (90C05)

Recommendations

• Recent developments in approximation algorithms for facility location and clustering problems
• scientific article; zbMATH DE number 1670526
• scientific article; zbMATH DE number 1559542
• scientific article; zbMATH DE number 1303535
• Analysis of a Local Search Heuristic for Facility Location Problems

Cited in

(11)

• An approximation framework for bounded facility location problems
• Facility location problems: a parameterized view
• The reliable facility location problem: formulations, heuristics, and approximation algorithms
• Facility Location Problems: A Parameterized View
• scientific article; zbMATH DE number 1253041 (Why is no real title available?)
• scientific article; zbMATH DE number 1159167 (Why is no real title available?)
• scientific article; zbMATH DE number 1947045 (Why is no real title available?)
• scientific article; zbMATH DE number 2159272 (Why is no real title available?)
• Recent developments in approximation algorithms for facility location and clustering problems
• scientific article; zbMATH DE number 764451 (Why is no real title available?)
• Discrete facility location in machine learning

This page was built for publication: A survey on approximation algorithms for facility location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259975)