한국경영과학회:학술대회논문집 (Proceedings of the Korean Operations and Management Science Society Conference)
- 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
- /
- Pages.381-385
- /
- 2003
대역폭 분할 문제를 위한 Branch-and-Price 알고리듬
A Branch-and-Price Algorithm for the Bandwidth Packing Problem
- Kim Deokseong (Dept. of Industrial Engineering, KAIST) ;
-
Lee Kyungsik
(School of Industrial Information & Systems Engineering, Hankuk University of Foreign Studies)
;
- Park Sungsoo (Dept. of Industrial Engineering, KAIST)
- 발행 : 2003.05.01
초록
We consider the bandwidth parking problem arising from telecommunication networks The problem is to determine the set of calls to be routed and an assignment or them to the paths in arc capacitated network. The objective is to maximize profit. We formulate the problem as an integer programming and propose an algorithm to solve it. Column generation technique to solve the linear programming relxation is proposed with two types of columns in addition, to obtain an optimum integer solution, we consider a new branching strategy. Computational experiments show that the algorithm gives option at solutions within reasonably small time limits.
키워드