Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Continuous_knapsack_problem> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items 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.".
- Continuous_knapsack_problem wikiPageID "8017444".
- Continuous_knapsack_problem wikiPageRevisionID "597014190".
- Continuous_knapsack_problem hasPhotoCollection Continuous_knapsack_problem.
- Continuous_knapsack_problem subject Category:Combinatorial_optimization.
- 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 m.080k86g.
- Continuous_knapsack_problem sameAs Q5165487.
- Continuous_knapsack_problem sameAs Q5165487.
- Continuous_knapsack_problem wasDerivedFrom Continuous_knapsack_problem?oldid=597014190.
- Continuous_knapsack_problem isPrimaryTopicOf Continuous_knapsack_problem.