When a Solver model includes integer constraints, it is called an integer programming problem. Solving such problems may require far more computing time than the same problem without the integer constraints.
The standard Solver, the Premium and Quadratic Solvers, and the Large-Scale LP Solver all use the Branch and Bound method to find optimal solutions to such problems. However, refinements to this method in the enhanced Solver products will often result in considerably faster solutions than those obtained with the standard Solver.
Related Topics: