Which of the following statements is true for Branch – and – Bound search?
(A) Underestimates of remaining distance may cause deviation from optimal path.
(B) Overestimates can’t cause right path to be overlooked.
(C) Dynamic programming principle can be used to discard redundant partial paths.
(D) All of the above
Answer: (C)
Explanation: Branch and bound is a type of problem solving technique which is used to solve a combinatorial optimization problems. It is helps in solving them faster compare to other technique.it divides a problem into two subproblem. For branch and bound search Dynamic programming principle can be used to discard redundant partial paths.
Option (C) is correct.
Quiz of this Question
Article Tags :
Recommended Articles