recategorized by
3,923 views
3 votes
3 votes

Which of the following statements is true for Branch-and-Bound search?

  1. Underestimates of remaining distance may cause deviation from optimal path
  2. Overestimates can't cause right path to be overlooked
  3. Dynamic programming principle can be used to discard redundant partial paths
  4. All of the above
recategorized by

1 Answer

Answer:

Related questions

1 votes
1 votes
1 answer
1
go_editor asked Jul 22, 2016
1,660 views
$\alpha - \beta$ cutoffs are applied toDepth first searchBest first searchMinimax searchBreadth first search
3 votes
3 votes
1 answer
3
go_editor asked Jul 31, 2016
3,265 views
An all-pairs shortest-paths problem is efficiently solved using:Dijkstra's algorithmBellman-Ford algorithmKruskal algorithmFloyd-Warshall algorithm
4 votes
4 votes
3 answers
4