Management Science and Financial Engineering

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Polynomial Time Algorithms for Solving the Multicommodity Flow Problems on Two Types of Directed Cycles

  • Published : 2009.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper considers the two kinds of integer multicommodity flow problems, a feasibility problem and a maximization problem, on two types of directed cycles, a unidirectional and a bidirectional cycle. Both multicommodity flow problems on an undirected cycle have been dealt with by many researchers and it is known that each problems can be solved by a polynomial time algorithm. However, we don't find any result on the directed cycles. Here we show that we can also solve both problems for a unidirectional and a bidirectional cycle in polynomial time.

Keywords

References

  1. Bartholdi, J. J., J. B. Orlin, and H. D. Ratliff, 'Cyclic scheduling via integer programs with circular ones,' Operations Research 28 (1980), 1074-1085 https://doi.org/10.1287/opre.28.5.1074
  2. Cosares, S., N. D. Deutch, I. Saniee, and O. J. Wasem, 'SONET toolkit: A decision support system for designing robust and cost-effective fiber-optic networks,' Interfaces 25 (1995), 20-40 https://doi.org/10.1287/inte.25.1.20
  3. Frank, A, T. Nishizeki, N. Saito, H. Suzuki, and E. Tardos, 'Algorithms for routing around a rectangle,' Discrete Applied Mathematics 40 (1992), 363-378 https://doi.org/10.1016/0166-218X(92)90007-W
  4. Myung, Y.-S., H.-G. Kim, and D.-W. Tcha, 'Optimal load balancing on SONET bidirectional rings,' Operations Research 45 (1997), 148-152 https://doi.org/10.1287/opre.45.1.148
  5. Myung, Y.-S., 'An efficient algorithm for the ring loading problem with integer demand splitting,' SIAM J. Discrete Mathematics 14 (2001), 291-298 https://doi.org/10.1137/S0895480199358709
  6. Myung, Y.-S. and H.-G. Kim, 'On the ring loading problem with demand splitting,' Operations Research Letters 32 (2004), 167-173 https://doi.org/10.1016/j.orl.2003.08.001
  7. Myung, Y.-S., 'Multicommodity flows in cycle graphs,' Discrete Applied Mathematics 154 (2006), 1615-1621 https://doi.org/10.1016/j.dam.2006.03.016
  8. Myung, Y.-S., 'Algorithms for maximum integer multiflow and multicut in a ring network,' Journal of the KORMS 32 (2007), 89-97
  9. Okamura, H. and P. D. Seymour, 'Multicommodity flows in planar graphs,' Journal of Combinatorial Theory Series B 31 (1981), 75-81 https://doi.org/10.1016/S0095-8956(81)80012-3
  10. Schrijver, A, P. Seymour, and P. Winkler, 'The ring loading problem,' SIAM J. Discrete Math 11 (1998), 1-14 https://doi.org/10.1137/S0895480195294994
  11. Schrijver, A, 'Combinatorial Optimization,' Springer, Berlin, 2003
  12. Suzuki, H., A Ishiguro, and T. Nishizeki, 'Variable-priority queue and doughnut routing,' Journal of Algorithms 13 (1992), 606-635 https://doi.org/10.1016/0196-6774(92)90059-L
  13. Vachani, R., A Shulman, and P. Kubat, 'Multi commodity flows in ring networks,' INFORMS Journal on Computing 8 (1996), 235-242 https://doi.org/10.1287/ijoc.8.3.235
  14. Wan, P.-J. and Y. Yang, 'Load-balanced routing in counter rotated SONET rings,' Networks 35 (2000), 279-286 https://doi.org/10.1002/1097-0037(200007)35:4<279::AID-NET7>3.0.CO;2-P
  15. Wang, B.-F., 'Linear time algorithm for the ring loading problem with demand splitting,' Journal of Algorithms 54 (2005), 45-57 https://doi.org/10.1016/j.jalgor.2004.03.003