An approximation algorithm for the k -level facility location problem with outliers

In this paper, we study the k-level facility location problem with outliers (k-LFLPWO), which is an extension of the well-known k-level facility location problem (k-LFLP). In the k-LFLPWO, we are given k facility location sets, a client location set of cardinality n and a non-negative integer $$q

Keywords:

• Cardinality
• Approximation algorithm
• Facility location problem
• Outlier
• Mathematical optimization
• Total cost
• Computational intelligence
• Computer science
• Integer

• Correction
• Source
• Cite
• Save
• Machine Reading By IdeaReader