List of knapsack problems
id:
list-of-knapsack-problems-296-6088839
title:
List of knapsack problems
text:
The knapsack problem is one of the most studied problems in combinatorial optimization, with many real-life applications. For this reason, many special cases and generalizations have been examined. Common to all versions are a set of n items, with each item 1 ≤ j ≤ n having an associated profit pj and weight wj. The binary decision variable xj is used to select the item. The objective is to pick some of the items, with maximal total profit, while obeying that the maximum total weight of the chos
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/List_of_knapsack_problems
date created:
date modified:
2024-02-09T17:51:03Z
main entity:
{"identifier":"Q4433780","url":"https://www.wikidata.org/entity/Q4433780"}
image:
fields total:
13
integrity:
13