Proceedings of the Korean Operations and Management Science Society Conference (한국경영과학회:학술대회논문집)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

A Branch-and-Price Algorithm for the Bandwidth Packing Problem

대역폭 분할 문제를 위한 Branch-and-Price 알고리듬

  • 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)
  • 김덕성 (한국과학기술윈 산업공학과) ;
  • 이경식 (한국외국어대학교 산업정보시스템공학부) ;
  • 박성수 (한국과학기술윈 산업공학과)
  • Published : 2003.05.01
Download PDF
⟨ Previous Next ⟩

Abstract

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.

Keywords