Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Continuous_knapsack_problem> ?p ?o }
Showing triples 1 to 31 of
31
with 100 triples per page.
- Continuous_knapsack_problem 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.".
- Continuous_knapsack_problem wikiPageID "8017444".
- Continuous_knapsack_problem wikiPageLength "3843".
- Continuous_knapsack_problem wikiPageOutDegree "11".
- Continuous_knapsack_problem wikiPageRevisionID "662064021".
- Continuous_knapsack_problem wikiPageWikiLink Algorithm.
- Continuous_knapsack_problem wikiPageWikiLink Analysis_of_algorithms.
- Continuous_knapsack_problem wikiPageWikiLink Category:Combinatorial_optimization.
- Continuous_knapsack_problem wikiPageWikiLink Combinatorial_optimization.
- Continuous_knapsack_problem wikiPageWikiLink George_Dantzig.
- Continuous_knapsack_problem wikiPageWikiLink Greedy_algorithm.
- Continuous_knapsack_problem wikiPageWikiLink Knapsack_problem.
- Continuous_knapsack_problem wikiPageWikiLink NP-hardness.
- Continuous_knapsack_problem wikiPageWikiLink Theoretical_computer_science.
- Continuous_knapsack_problem wikiPageWikiLink Time_complexity.
- Continuous_knapsack_problem wikiPageWikiLink Weighted_median.
- Continuous_knapsack_problem wikiPageWikiLinkText "Continuous knapsack problem".
- Continuous_knapsack_problem wikiPageWikiLinkText "continuous knapsack problem".
- Continuous_knapsack_problem wikiPageUsesTemplate Template:Reflist.
- Continuous_knapsack_problem subject Category:Combinatorial_optimization.
- Continuous_knapsack_problem hypernym Problem.
- Continuous_knapsack_problem type Disease.
- Continuous_knapsack_problem type Algorithm.
- Continuous_knapsack_problem type Page.
- Continuous_knapsack_problem 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.".
- Continuous_knapsack_problem label "Continuous knapsack problem".
- Continuous_knapsack_problem sameAs Q5165487.
- Continuous_knapsack_problem sameAs m.080k86g.
- Continuous_knapsack_problem sameAs Q5165487.
- Continuous_knapsack_problem wasDerivedFrom Continuous_knapsack_problem?oldid=662064021.
- Continuous_knapsack_problem isPrimaryTopicOf Continuous_knapsack_problem.