An approximation algorithm for the \(k\)-level facility location problem with outliers
type: Item
instance of: scholarly article
title: An approximation algorithm for the \(k\)-level facility location problem with outliers
zbMATH Open document ID: 1475.90032
author: Lu Han
author: Dandan Liu
author: Dachuan Xu
author: Chenchen Wu
published in: Optimization Letters
publication date: 2021-08-19T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7383565
zbMATH Keywords: facility location problem
zbMATH Keywords: outliers
zbMATH Keywords: approximation algorithm
zbMATH Keywords: primal-dual
MaRDI profile type: Publication
full work available at URL: s11590-021-01701-8
OpenAlex ID: W3123841022
cites work: A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
cites work: Local Search Heuristics for k-Median and Facility Location Problems
cites work: An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties
cites work: Q4780783
cites work: An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
cites work: An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
cites work: Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties)
cites work: Improved Combinatorial Algorithms for Facility Location Problems
cites work: Algorithms for facility location problems with outliers. (Extended abstract)
cites work: Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
cites work: Greedy Strikes Back: Improved Facility Location Algorithms
cites work: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Q5743432
cites work: A 1.488 approximation algorithm for the uncapacitated facility location problem
cites work: Improved approximation algorithms for the facility location problems with linear/submodular penalties
cites work: Q4411290
cites work: Q4526991
cites work: Stochastic Transportation-Inventory Network Design Problem
cites work: Q4737531
cites work: Warehouse-Retailer Network Design Problem
cites work: Approximation algorithms for the robust/soft-capacitated 2-level facility location problems
cites work: Approximating the two-level facility location problem via a quasi-greedy approach
cites work: A local search approximation algorithm for the \(k\)-means problem with penalties
DOI: 10.1007/S11590-021-01701-8
description: scientific article; zbMATH DE number 7383565