Matches in DBpedia 2014 for { <http://dbpedia.org/resource/List_of_knapsack_problems> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- List_of_knapsack_problems abstract "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 having an associated profit pj ,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 chosen items must not exceed W. Generally, these coefficients are scaled to become integers, and they are almost always assumed to be positive.The knapsack problem in its most basic form:".
- List_of_knapsack_problems wikiPageExternalLink 95-1.pdf.
- List_of_knapsack_problems wikiPageID "4995497".
- List_of_knapsack_problems wikiPageRevisionID "599515963".
- List_of_knapsack_problems hasPhotoCollection List_of_knapsack_problems.
- List_of_knapsack_problems subject Category:Combinatorial_optimization.
- List_of_knapsack_problems comment "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 having an associated profit pj ,weight wj. The binary decision variable xj is used to select the item.".
- List_of_knapsack_problems label "List of knapsack problems".
- List_of_knapsack_problems label "Список задач о ранце".
- List_of_knapsack_problems sameAs Q4433780.
- List_of_knapsack_problems sameAs Q4433780.
- List_of_knapsack_problems wasDerivedFrom List_of_knapsack_problems?oldid=599515963.
- List_of_knapsack_problems isPrimaryTopicOf List_of_knapsack_problems.