README.md
In LiU-Task/FancyPackRLiU6: Knapsack
FancyPackRLiU6
Knapsack pilot
Description
The package presents three typical ways of resolving Knapsack problem, with brutal force, dynamic programing and approximate solutions. By means of exploring different computing complexities, a better understanding of fast code has been reached.
Fields
x, a data frame of items with different values and weights
W, the capacity of knapsack
Return
a list with best value and selected elements
Pass status of Travis building:
name<-"Jun Li"
liuid<-"junli559"
LiU-Task/FancyPackRLiU6 documentation built on Oct. 30, 2019, 8:24 p.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.
FancyPackRLiU6
Knapsack pilot
Description
The package presents three typical ways of resolving Knapsack problem, with brutal force, dynamic programing and approximate solutions. By means of exploring different computing complexities, a better understanding of fast code has been reached.
Fields
x, a data frame of items with different values and weights
W, the capacity of knapsack
Return
a list with best value and selected elements
Pass status of Travis building:
name<-"Jun Li" liuid<-"junli559"
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.