Hi,
Does some have been in the situation to solve the Knapsack problem in EWM when doing the picking?
Here is the information about the problem Knapsack problem - Wikipedia, the free encyclopedia
Basically problem: "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"
My question would be: Has EWM something standard to solve this? or do I have to implement my own algorithm?
Thank you!
