Branch and bound
Registered by
Assem Chelli (عاصم شلي)
Branch and bound (BB) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. It consists of a systematic enumeration of all candidate solutions, where large subsets of fruitless candidates are discarded en masse, by using upper and lower estimated bounds of the quantity being optimized.
Blueprint information
- Status:
- Complete
- Approver:
- None
- Priority:
- Medium
- Drafter:
- None
- Direction:
- Needs approval
- Assignee:
- Assem Chelli (عاصم شلي)
- Definition:
- Discussion
- Series goal:
- None
- Implementation:
-
Implemented
- Milestone target:
- None
- Started by
- Assem Chelli (عاصم شلي)
- Completed by
- Assem Chelli (عاصم شلي)
Related branches
Related bugs
Sprints
Whiteboard
(?)
