Sciweavers

CCO
2001
Springer

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

13 years 8 months ago
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.
Alexander Martin
Added 28 Jul 2010
Updated 28 Jul 2010
Type Conference
Year 2001
Where CCO
Authors Alexander Martin
Comments (0)