Branch and Bound
Search the solution tree while discarding branches whose best possible result can't beat the current best.
Advanced
Used for knapsack, travelling salesman and integer programming.
Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.
Discussion (0)
Sign in or join free to ask questions and discuss this topic.