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.
CITATION STYLE
Martin, A. (2001). General mixed integer programming: Computational issues for branch-and-cut algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2241, pp. 1–25). Springer Verlag. https://doi.org/10.1007/3-540-45586-8_1
Mendeley helps you to discover research relevant for your work.