greedy_knapsack: using some heuristic or common sense knowledge to generate a...
In josme478/lab06: Answers for Lab06
Description
Usage
Arguments
Value
Examples
Description
using some heuristic or common sense knowledge to generate a sequence of suboptimum that hopefully converges to an optimum value.
Usage
1
greedy_knapsack(x, W)
Arguments
x
A dataframe with two columns: the values (v) and the weights (w) of each item to put in the knapsack.
W
A positive number representing the knapsack size..
Value
A list of two elements: a positive number with the maximum knapsack value and a vector of all the elements in the knapsack size.
Examples
1
greedy_knapsack(x = knapsack_objects[1:800,], W = 3500)
josme478/lab06 documentation built on Nov. 4, 2019, 3:21 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.
Description Usage Arguments Value Examples
Description
using some heuristic or common sense knowledge to generate a sequence of suboptimum that hopefully converges to an optimum value.
Usage
1 | greedy_knapsack(x, W)
|
Arguments
x |
A dataframe with two columns: the values (v) and the weights (w) of each item to put in the knapsack. |
W |
A positive number representing the knapsack size.. |
Value
A list of two elements: a positive number with the maximum knapsack value and a vector of all the elements in the knapsack size.
Examples
1 | greedy_knapsack(x = knapsack_objects[1:800,], W = 3500)
|
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.