MIPs often solve faster with good integer feasible solutions. Thus, Gurobi contains a variety of MIP heuristics to create integer solutions and improve them. However, sometimes you can improve upon this with custom integer heuristics that exploit model structure.

In this webinar, you will learn:

What models may benefit from custom MIP heuristics, and how to build your own custom MIP heuristics by using the traveling salesman problem to illustrate different integer heuristics that take advantage of both model structure and relaxed solution values in the MIP tree.

Presented Materials

Download the presentation, here.