18.191.228.88
18.191.228.88
close menu
혼합유전알고리즘을 통한 최대유통문제에서의 다수치명호 탐색
Finding the K Most Vital Arcs in Maximum Flow Problem with Hybrid Genetic Algorithm
이성우 ( Sung Woo Lee ) , 이상완 ( Sang Wan Lee ) , 조성열 ( Sung Yol Cho )
UCI I410-ECN-0102-2009-550-006559150

The K most vital arcs problem is to find the specificl arcs which have the smallest maximuml flow values in the maximum flow problem by removing some arcs from the capacitated network. It means that the K most vital arcs is very important to maintain and

[자료제공 : 네이버학술정보]
×