New approximation algorithms for the unsplittable capacitated facility location problem

DOI10.1007/S00453-015-0012-ZMaRDI QIDQ300454zbMATH OpenOpenAlexFDO

Authors Babak Behsaz, Mohammad Salavatipour, Zoya Svitkina

Publication date 28 June 2016

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-015-0012-z

zbMATH Keywords

approximation algorithmscapacitated facility locationhard capacities

Mathematics Subject Classification ID

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

Recommendations

• New approximation algorithms for the unsplittable capacitated facility location problem
• A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem
• Approximation algorithms for hard capacitated \(k\)-facility location problems
• Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
• An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem

Cites work

• scientific article; zbMATH DE number 1187151 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• scientific article; zbMATH DE number 1303535 (Why is no real title available?)
• scientific article; zbMATH DE number 1303608 (Why is no real title available?)
• scientific article; zbMATH DE number 1305496 (Why is no real title available?)
• scientific article; zbMATH DE number 1342123 (Why is no real title available?)
• scientific article; zbMATH DE number 1947060 (Why is no real title available?)
• scientific article; zbMATH DE number 1559542 (Why is no real title available?)
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• scientific article; zbMATH DE number 1775394 (Why is no real title available?)
• scientific article; zbMATH DE number 1775400 (Why is no real title available?)
• A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
• A 3-approximation for facility location with uniform capacities
• A 5-approximation for capacitated facility location
• A new greedy approach for facility location problems
• A tight bound on approximating arbitrary metrics by tree metrics
• Algorithms - ESA 2003
• An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
• An approximation algorithm for the generalized assignment problem
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Assignment problem in content distribution networks, unsplittable hard-capacitated facility location
• Bin packing can be solved within 1+epsilon in linear time
• Integer Programming and Combinatorial Optimization
• Integer Programming and Combinatorial Optimization
• Local search heuristic for k-median and facility location problems

Cited in

(8)

• New approximation algorithms for the unsplittable capacitated facility location problem
• Assignment problem in content distribution networks, unsplittable hard-capacitated facility location
• scientific article; zbMATH DE number 1187151 (Why is no real title available?)
• Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
• A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
• Approximating airports and railways
• A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem
• Airports and railways with unsplittable demand

This page was built for publication: New approximation algorithms for the unsplittable capacitated facility location problem

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