Approximation algorithms for the ring loading problem with penalty cost

Online algorithms for the mixed ring loading problem with two nodes

“…Due to the extensive applications in metropolitan area networks [5] and fiber-opticbased telecommunication networks [14], Cosares and Saniee [3] introduced the ring loading problem, which has been extensively studied in the literature [4][5][6][7][8][9][10][11][12][13][14]. Three kinds of models have been considered in previous studies of the ring loading problem: (1) demands may be sent either in the front or back route with demand splitting; (2) demands are allowed to be split into two parts but restricted to be integrally split; and (3) each demand must be routed entirely in either of the two directions without demand splitting.…”

“…Wilfong and Winkler [16] designed an optimal algorithm for the bidirected ring. Li et al [8] studied the ring loading problem with penalty cost which is N P-hard, and designed a 1.58-approximation algorithm. Havill and Hutson [5] When the demands are integer splittable, Myung et al [10] provided an O(nk) time optimal algorithm.…”

Discrete Particle Swarm Optimization Algorithms for the Prize-Collecting Call Control Problem on Lines

“…Bar-Noy et al [5] presented approximation algorithms for solving resource allocation and scheduling problems, which factors applied to many problems such as dynamic storage allocation and so on. Li.et al [7] considered another problem about UFP, which is the ring loading problem with penalty cost. In that paper, they showed a 1.58-approximation algorithm for the demand unsplittable case.…”