[數學]Algorithm

[數學]Algorithm

訪客 於 星期六 十一月 10, 2012 10:22 pm


Give a greedy method,which is heuristic,to solve the 0/1 knapsack problem

and also give an example to show that it does not always yieldan optimal solution


拜託大大們 我想不出來~~~~

訪客

 






大學以上數學問題