Knapsack Problem 정보
그 해결사
The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a mass and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.
http://en.wikipedia.org/wiki/Knapsack_problem
Basically, its a solver for a variation of this problem, the knapsack 0/1 problem
추가 앱 정보
최신 버전 1의 새로운 기능
Last updated on Apr 24, 2018
이 버전에는 사소한 버그 수정과 전반적인 개선 사항이 포함되어 있습니다. 최상의 환경을 위해 최신 버전으로 업데이트하세요.
Knapsack Problem 스크린 샷
Knapsack Problem의 오래된 버전
265.6 KBApr 24, 2018
