Solving MIPs
Linear programming based branch-and-bound is the heart of state-of-the-art “mixed integer program” (MIP) software
Default parameters
- Out of the box for LP
- Tweaking for MIPs can have big impact.
- But it can be an effort to find the right combination
Goodies in MIP solvers:
- Advance search strategies
- Preprocessing
- Probing
- Cutting planes
- Primal Heuristics
Allows user to develop “customized” approaches