Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem 133 (Knapsack Problem) — Constraint detection

Given a set of items , each with a weight and a value , determine the number of each item to include in a sack so that the total weight is at most a given capacity and the total value is as large as possible .

Problem 133 (Knapsack Problem) — Detection of the decisions and objects to be modeled

Given a set of items , each with a weight and a value , determine the number of each item to include in a sack so that the total weight is at most a given capacity and the total value is as large as possible .

Back to list