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.
댓글
댓글