An approximation algorithm for the k-level capacitated facility location problem
We consider the k-level capacitated facility location problem (k-CFLP), which is a natural variant of the classical facility location problem and has applications in supply chain management. We obtain the first (combinatorial) approximation algorithm with a performance factor of k + 2 + root k(2) + 2k + 5 + epsilon (epsilon > 0) for this problem.
approximation algorithm capacitated facility location problem local search