Facility location with red-blue demands

DOI10.1016/J.ORL.2014.08.002zbMATH Open1408.90158OpenAlexW2061368765MaRDI QIDQ1785285FDOQ1785285

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

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

zbMATH Keywords

approximation algorithmsfacility locationLP-rounding

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Approximation algorithms for data placement in arbitrary networks
• Approximation Algorithms for Data Placement Problems
• The matroid median problem
• A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
• Budgeted red-blue median and its generalizations

Cited In (2)

• Title not available (Why is that?)
• 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)