Computational Combinatorial Optimization
Lecture Notes in Computer Science, 2001, Volume 2241/2001, 1-25, DOI: 10.1007/3-540-45586-8_1

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

Alexander Martin

View Related Documents

Abstract

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.

Fulltext Preview

Image of the first page of the fulltext document