Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5165487> ?p ?o }
Showing triples 1 to 15 of
15
with 100 triples per page.
- Q5165487 subject Q8391417.
- Q5165487 abstract "In theoretical computer science, the continuous knapsack problem (also known as the fractional knapsack problem) is an algorithmic problem in combinatorial optimization in which the goal is to fill a container (the "knapsack") with fractional amounts of different materials chosen to maximize the value of the selected materials. It resembles the classic knapsack problem, in which the items to be placed in the container are indivisible; however, the continuous knapsack problem may be solved in polynomial time whereas the classic knapsack problem is NP-hard. It is a classic example of how a seemingly small change in the formulation of a problem can have a large impact on its computational complexity.".
- Q5165487 wikiPageWikiLink Q1137554.
- Q5165487 wikiPageWikiLink Q1333872.
- Q5165487 wikiPageWikiLink Q2393193.
- Q5165487 wikiPageWikiLink Q2878974.
- Q5165487 wikiPageWikiLink Q333464.
- Q5165487 wikiPageWikiLink Q337040.
- Q5165487 wikiPageWikiLink Q504353.
- Q5165487 wikiPageWikiLink Q7979899.
- Q5165487 wikiPageWikiLink Q8366.
- Q5165487 wikiPageWikiLink Q8391417.
- Q5165487 wikiPageWikiLink Q864457.
- Q5165487 comment "In theoretical computer science, the continuous knapsack problem (also known as the fractional knapsack problem) is an algorithmic problem in combinatorial optimization in which the goal is to fill a container (the "knapsack") with fractional amounts of different materials chosen to maximize the value of the selected materials.".
- Q5165487 label "Continuous knapsack problem".