YLL討論網

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


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