General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms

In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on preprocessing techniques, branch-and-bound issues and cutting plane generation.

• Type: Conference
• Year: 2001
• Where: CCO
• Authors: Alexander Martin
• Keywords: Branch-and-bound Issues, CCO 2001, Combinatorics, Mixed Integer Programming, State-of-the-art Branch-and-cut Algorithms