Primal Heuristics in Integer Programming

Primal heuristics guarantee that feasible, high-quality solutions are provided at an early stage of the solving process, and thus are essential to the success of mixed-integer programming (MIP).By helping prove optimality faster, they allow MIP technology to extend to a wide variety of applications in discrete optimization.This first comprehensive guide to the development and use of primal heuristics within MIP technology and solvers is ideal for computational mathematics graduate students and industry practitioners.Through a unified viewpoint, it gives a unique perspective on how state-of-the-art results are integrated within the branch-and-bound approach at the core of the MIP technology.It accomplishes this by highlighting all the required knowledge needed to push the heuristic side of MIP solvers to their limit and pointing out what is left to do to improve them, thus presenting heuristic approaches for MIP as part of the MIP solving process.