Discussion
What must the bound in branch and bound satisfy?
Answer: D
The bound must be optimistic, never claiming a branch is worse than it truly is, or a branch containing the optimum could be pruned. That is exactly the admissibility condition in another guise. Exact computation is unnecessary and usually impossible, the incumbent cost is what the bound is compared against, and incremental computation is normal. The same one sided condition guaranteeing optimality appears in search, in games and here, which is worth noticing as a unifying pattern.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development