Continuous knapsack problem
id:
continuous-knapsack-problem-318-4549021
title:
Continuous knapsack problem
text:
In theoretical computer science, the continuous knapsack problem is an algorithmic problem in combinatorial optimization in which the goal is to fill a container 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
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Continuous_knapsack_problem
date created:
date modified:
2022-01-04T03:16:05Z
main entity:
{"identifier":"Q5165487","url":"https://www.wikidata.org/entity/Q5165487"}
image:
fields total:
13
integrity:
13