An efficient implementation of branch-and-cut algorithm for mixed integer programming

혼합정수계획법을 위한 분지한계법의 효율적인 구현

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.