Rdocumentation
powered by
Learn R Programming
KnapsackSampling (version 0.1.1)
Generate Feasible Samples of a Knapsack Problem
Description
The sampl.mcmc function creates samples of the feasible region of a knapsack problem with both equalities and inequalities constraints.
Copy Link
Link to current version
Version
Version
0.1.1
0.1.0
Install
install.packages('KnapsackSampling')
Monthly Downloads
235
Version
0.1.1
License
GPL (>= 2) | file LICENSE
Issues
0
Pull Requests
0
Stars
1
Forks
0
Repository
https://github.com/chinsoon12/KnapsackSampling
Maintainer
Chin Soon Lim
Last Published
January 31st, 2024
Functions in KnapsackSampling (0.1.1)
Search all functions
initState
Generate an initial feasible solution by solving a linear programming with binary variables
flip01
Flip a 1 and a 0 simultaneously
sampl.mcmc
Generate feasible solutions to a knapsack problem using Markov Chain Monte Carlo