knapsack-package: knapsack
In abhi-vellala/732A94lab6: Knapsack Problem Algorithms
Description
Sixth lab of the course Advanced R Programming!
Details
The package contains three different functions for solving the so-called knapsack problem, which is considered NP-hard.
It is basically an optimization problem where a knapsack of limited weight has to be filled with a number of items of different value and weight, aiming to have the highest total value at the end.
It is an open (Millennium Prize) problem, whether it is or is not possible to solve these problem in polynomial time.
abhi-vellala/732A94lab6 documentation built on Oct. 31, 2019, 1:54 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description
Sixth lab of the course Advanced R Programming!
Details
The package contains three different functions for solving the so-called knapsack problem, which is considered NP-hard.
It is basically an optimization problem where a knapsack of limited weight has to be filled with a number of items of different value and weight, aiming to have the highest total value at the end.
It is an open (Millennium Prize) problem, whether it is or is not possible to solve these problem in polynomial time.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.