한국경영과학회지 (Journal of the Korean Operations Research and Management Science Society)
- 제19권2호
- /
- Pages.1-19
- /
- 1994
- /
- 1225-1119(pISSN)
- /
- 2733-4759(eISSN)
정수 일반네트워크문제를 위한 분지한계법의 개선
Improvment of Branch and Bound Algorithm for the Integer Generalized Nntwork Problem
초록
A generalized network problem is a special class of linear programming problem whose coefficient matrix contains at most two nonzero elements per column. A generalized network problem with 0-1 flow restrictions is called an integer generalized network(IGN) problem. In this paper, we presented a branch and bound algorithm for the IGN that uses network relaxation. To improve the procedure, we develop various strategies, each of which employs different node selection criterion and/or branching variable selection criterion. We test these solution strategies and compare their efficiencies with LINDO on 70 randomly generated problems.
키워드