한국경영과학회:학술대회논문집 (Proceedings of the Korean Operations and Management Science Society Conference)
- 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
- /
- Pages.1-8
- /
- 2002
혼합정수계획법을 위한 분지한계법의 효율적인 구현
An efficient implementation of branch-and-cut algorithm for mixed integer programming
- 발행 : 2002.05.01
초록
A Branch-and-Cut algorithm is a branch-and-bound algorithm in which rutting planes are generated throughout the branch-and-bound tree. It is now one of the most widespread and successful methods for solving mixed integer programming problems. In this paper we presents efficient implementation techniques of branch-and-cut algorithm for miked integer programming problems.
키워드