Approximation algorithms for the ring loading problem with penalty cost
We introduce the ring loading problem with penalty cost. We designed a 1.58-approximation algorithm for the integer demand splittable case. We designed a (1.58+? 1.58 + ? )-approximation algorithm for the demand unsplittable case, for any ?>0 ? > 0 .
approximation algorithms ring loading penalty cost