http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
분지한계기법을 이용한 무환네트워크에서 최대물동량경로의 해법에 관한 연구
성기석,임준묵 한국경영과학회 1995 韓國經營科學會誌 Vol.20 No.3
The Maximum Origin-Destination Flow Path Problem (MODFP) in an Acyclic Network has known as NP-hard. K. S. Sung has suggested an Optimal Algorithm for MODFP based on the 'Pseudo flow of arc' and the K-th shortest path algorithm. When we try to solve MODFP problem by general Branch and Bound Method (BBM), the upper and lower bounds of subproblems are so weak that the BBM become very inefficient. Here we utilized the 'Pseudo flow of arc' for the tight bounds of subproblems so that it can produce an efficient BBM for MODFP problem.