Norwegian University of Science and Technology MILP algorithms: branch-and-bound and branch-and-cut.
Computational Experiences with Branching on Hyperplane Algorithm for Mixed Integer Programming
