Branch and Cut Methods for Mixed Integer Linear Programming Problems

Abstract

The discrete optimization problems arising in industry are typically very large and computationally difficult to solve. Over the past decade, the method of Branch and Cut has emerged as a powerful technique for solving large mixed integer linear programming problems. Advances in computer technology together with advances in computational algorithms now makes it possible to obtain provably good solutions for many industrial optimization problems. This paper focuses on the application of Branch and Cut. An example from the mining industry demonstrates the value of the method.