UGC NET CSE | Junet 2015 | Part 3 | Question: 58

Question

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 1

ans is c is correct answer

FOR MORE https://en.wikipedia.org/wiki/Branch_and_bound