전화통화 경로설정 문제의 증대경로 알고리즘

This paper deals with the optimization problem that decides the routing of connection between multi-source and multi-sink. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper w...

Full description

Saved in:
Bibliographic Details
Published in한국컴퓨터정보학회논문지, 21(6) pp. 77 - 81
Main Author 이상운
Format Journal Article
LanguageKorean
Published 한국컴퓨터정보학회 01.06.2016
Subjects
컴퓨터학
Online AccessGet full text
ISSN1598-849X
2383-9945

Cover

More Information
Summary:This paper deals with the optimization problem that decides the routing of connection between multi-source and multi-sink. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with    time complexity to solve the optimal solution for this problem. This paper suggests the simple method that assigns the possible call flow quantity to augmenting path of   city pair satisfied with demand of  . The proposed algorithm can be get the same optimal solution as LP for experimental data. KCI Citation Count: 0
Bibliography:G704-001619.2016.21.6.015
ISSN:1598-849X
2383-9945