Q.

Which of the following optimization problem(s) can be better solved with Order GA?

A. 0-1 Knapsack problem
B. Travelling salesman problem
C. Job shop scheduling problem
D. Optimal binary search tree construction problem
Answer» B. Travelling salesman problem
5.4k
0
Do you find this helpful?
26

Discussion

No comments yet