Greedy algorithms for the single-demand facility location problem

DOI10.1016/j.orl.2017.07.002zbMath1409.90102OpenAlexW2735184074MaRDI QIDQ1728306

David P. Williamson, Sin-Shuen Cheung

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.07.002

zbMATH Keywords

approximation algorithmgreedy algorithmfacility location

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

Easy capacitated facility location problems, with connections to lot-sizing

Cites Work

• Tightening simple mixed-integer sets with guaranteed bounds
• Primal-dual schema for capacitated covering problems
• Deterministic Production Planning: Algorithms and Complexity
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Reducibility among Combinatorial Problems
• Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
• Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Greedy algorithms for the single-demand facility location problem