パッケージ:
com.vorogushinigor.knapsackproblem
ダウンロード:
100
サイズ:
2.2 MB
Android 要件:
2.3.3 以上
アップデート:
2014年11月15日
One of the NP-complete combinatorial optimization problems. Title received from their maximization problem of laying as many valuables in a backpack with the proviso that the total volume of all the objects that can fit in a backpack, limited.
コメント