Home/Questions/Q 799061
Next
VARISHA PARVEZ
  • 0
Asked: 2023-05-05T14:15:30+00:00 In:

Which of the following is a technique for solving optimization problems by iteratively improving a candidate solution? a) Greedy algorithm b) Dynamic programming c) Branch and bound d) Local search

  • 0
Which of the following is a technique for solving optimization problems by iteratively improving a candidate solution? a) Greedy algorithm b) Dynamic programming c) Branch and bound d) Local search
algorithmitlanguage
Share

    You must login to add an answer.

    Need An Account,

    Related Questions