In this lecture we describe the branch-and-cut algorithm, which is currently the state-of-the-art approach for solving mixed-integer optimization problems. We first describe the basic branch-and-bound framework, where efficiently solvable linear programming relaxations are used to eliminate parts of the search space. We then discuss the impact o...
Luedtke, Jim (University of Wisconsin, Madison)
University of Minnesota, Institute for Mathematics and its Applications.