On stacking bi-directional self-healing-rings on a conduit ring
Computers and Industrial Engineering
Linear time algorithms for the ring loading problem with demand splitting
Journal of Algorithms
A 1.5 Approximation Algorithm for Embedding Hyperedges in a Cycle
IEEE Transactions on Parallel and Distributed Systems
Multicommodity flows in cycle graphs
Discrete Applied Mathematics
Journal of Discrete Algorithms
Communication: Integral polyhedra related to integer multicommodity flows on a cycle
Discrete Applied Mathematics
A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
Theoretical Computer Science
A compact formulation of the ring loading problem with integer demand splitting
Operations Research Letters
On the ring loading problem with demand splitting
Operations Research Letters
Approximation algorithms for the ring loading problem with penalty cost
Information Processing Letters
| Hi-index | 0.01 |
In the ring loading problem, traffic demands are given for each pair of nodes in an undirected ring network and a flow is routed in either of two directions, clockwise and counterclockwise. The load of an edge is the sum of the flows routed through the edge and the objective of the problem is to minimize the maximum load on the ring. Myung [J. Korean OR and MS Society, 23 (1998), pp. 49--62 (in Korean)] has presented an efficient algorithm for solving a problem where flow is restricted to integers. However, the proof for the validity of the algorithm in their paper is long and complicated and as the paper is written in Korean, its accessibility is very limited. In this paper, we slightly modify their algorithm and provide a simple proof for the correctness of the proposed algorithm.