Branch and Bound
B&BAn algorithm for solving integer and combinatorial optimization problems by systematically exploring the solution space while pruning branches that cannot contain optimal solutions.
Explanation
Branch and bound divides the problem into smaller subproblems (branching) and computes bounds on the best possible solution in each subproblem. If a bound shows that a subproblem cannot improve on the best known solution, that branch is pruned. This avoids exploring the entire solution space while guaranteeing optimality.
How kint Uses It
Branch and bound is the core algorithm behind kint's MIP solving. kint enhances standard B&B with ML-predicted branching strategies and warm starts from neural network models, significantly reducing solve times.
See Branch and Bound in action
kint applies B&B to solve real business problems. Let us show you what's possible.
Get in touch