Approximation algorithms for the priority facility location problem with penalties

DOI10.1007/S11424-014-2157-2zbMATH Open1330.49034OpenAlexW2144709496MaRDI QIDQ905151FDOQ905151

Authors: Fengmin Wang, Dachuan Xu, Chenchen Wu 

Publication date: 14 January 2016

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-014-2157-2

Recommendations

• Approximation algorithms for the priority facility location problem with submodular penalties
• Approximation algorithms for the stochastic priority facility location problem
• scientific article; zbMATH DE number 5811147
• Approximation Algorithms for the Robust Facility Location Problem with Penalties
• Improved approximation algorithms for the facility location problems with linear/submodular penalties
• Approximation algorithms for the fault-tolerant facility location problem with penalties
• Improved approximation algorithms for the facility location problems with linear/submodular penalty
• A primal-dual approximation algorithm for the facility location problem with submodular penalties
• scientific article; zbMATH DE number 1670526
• An improved approximation algorithm for uncapacitated facility location problem with penalties

zbMATH Keywords

greedy augmentationprimal-dual approximation algorithmpenaltiespriority facility location problem

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20)

Cites Work

• An improved approximation algorithm for uncapacitated facility location problem with penalties
• An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
• Approximating the two-level facility location problem via a quasi-greedy approach
• Algorithms for facility location problems with outliers. (Extended abstract)
• Title not available (Why is that?)
• Approximation algorithms for soft-capacitated facility location in capacitated network design
• A new approximation algorithm for the \(k\)-facility location problem
• A primal-dual approximation algorithm for the facility location problem with submodular penalties
• A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
• Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
• Improved Combinatorial Algorithms for Facility Location Problems
• A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
• Title not available (Why is that?)
• Network design for information networks
• Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization
• An approximation algorithm for the \(k\)-level capacitated facility location problem
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Approximation algorithms for the stochastic priority facility location problem
• Multicommodity facility location

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorial approximation algorithms for the robust facility location problem with penalties
• Approximation algorithms for the robust/soft-capacitated 2-level facility location problems
• Approximation algorithm for resource allocation problems with time dependent penalties
• The power of priority algorithms for facility location and set cover
• Approximation Algorithms for the Robust Facility Location Problem with Penalties
• Title not available (Why is that?)
• Approximation algorithms for the priority facility location problem with submodular penalties

This page was built for publication: Approximation algorithms for the priority facility location problem with penalties

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