A primal-dual polynomial approximation algorithm for the uncapacitated facility location problem

DOI10.1134/S0081543826600043MaRDI QIDQ7267941zbMATH OpenFDO

Authors Eh. Kh. Gimadi, Evgeniĭ Nikolaevich Goncharov, Alexandr A. Shtepa

Publication date 17 June 2026

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0081543826600043

zbMATH Keywords

algorithm with a posteriori performance guaranteeapproximation algorithmbinary heapfacility location problemNP-hard problemprimal-dual algorithm

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites work

• Analytical approach to parallel repetition
• Clustering by passing messages between data points
• Facility location models for distribution system design
• Facility location models for immobile servers with stochastic demand
• Handbook of heuristics
• scientific article; zbMATH DE number 4202014 (Why is no real title available?)
• scientific article; zbMATH DE number 3626912 (Why is no real title available?)
• Primal-dual variable neighborhood search for the simple plant-location problem

This page was built for publication: A primal-dual polynomial approximation algorithm for the uncapacitated facility location problem

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