Home▸Mathematics▸Integer Programming: Branch & Bound

🌳 Integer Programming: Branch & Bound

Watch a branch-and-bound search tree grow in real time as it solves a small integer-programming problem: each node's LP relaxation is solved, fractional solutions are branched into two child bounds, and inferior or infeasible branches are pruned in grey until the best integer solution is found in green.

Mathematics3DModerate60 FPS

⚙ Under the hood

Animated 3D branch-and-bound search tree for integer linear programming: each node solves an LP relaxation of a tunable resource-allocation problem, fractional optima branch into two integer-bounded child nodes, and infeasible or dominated branches are pruned grey while the best integer incumbent is tracked in green.

Three.jsOptimizationBranch and BoundLinear ProgrammingAlgorithms

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install