Discussion
What is branch and bound in a constraint optimisation problem?
Answer: C
Keeping the cost of the best solution so far and abandoning any branch whose optimistic cost estimate already exceeds it prunes enormously while preserving optimality. It is the constraint optimisation counterpart of alpha beta pruning. Decomposition, branch limits and region restriction are different techniques. A bound that is provably optimistic, used to discard work that cannot help, is the same idea as an admissible heuristic seen from another direction.
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