knapsack-class: knapsack problem
In fengye0907/LAB6C: A package for lab6
Description
The package contains three different functions for solving what is called the knapsack problem.
The knapsack problem is a discrete optimization problem where we have a knapsack that can take a
limited weight 'W' and we want to fill this knapsack with a number of items i = 1, ..., n, each with a
weight w_i and a value v_i. The goal is to find the knapsack with the largest value of the elements added
to the knapsack.
fengye0907/LAB6C documentation built on May 10, 2019, 8:25 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
The package contains three different functions for solving what is called the knapsack problem. The knapsack problem is a discrete optimization problem where we have a knapsack that can take a limited weight 'W' and we want to fill this knapsack with a number of items i = 1, ..., n, each with a weight w_i and a value v_i. The goal is to find the knapsack with the largest value of the elements added to the knapsack.
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.