Facility location with red-blue demands

DOI10.1016/J.ORL.2014.08.002MaRDI QIDQ1785285zbMATH OpenOpenAlexFDO

Authors Sonika Arora, Neelima Gupta, Samir Khuller, Yogish Sabharwal, Swati Singhal

Publication date 28 September 2018

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

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

zbMATH Keywords

approximation algorithmsfacility locationLP-rounding

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Recommendations

• LP-rounding algorithms for the fault-tolerant facility placement problem (extended abstract)
• scientific article; zbMATH DE number 1559542
• Facility location with service installation costs
• Integer Programming and Combinatorial Optimization
• Local search algorithms for the red-blue median problem

Cites work

• scientific article; zbMATH DE number 1559542 (Why is no real title available?)
• A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
• Approximation Algorithms for Data Placement Problems
• Approximation algorithms for data placement in arbitrary networks
• Budgeted red-blue median and its generalizations
• The matroid median problem

Cited in

(2)

• scientific article; zbMATH DE number 7561427 (Why is no real title available?)
• The multimode covering location problem

This page was built for publication: Facility location with red-blue demands

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