Vidyalelo
Data Structure · Q55

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 55

Q55

Which of the following is not a branch and bound strategy to generate branches?

A.
LIFO branch and bound
B.
FIFO branch and bound
C.
Lowest cost branch and bound
D.
Highest cost branch and bound
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board