https://github.com/damascenorafael/mcmc-knapsack-problem

Python development to solve the 0/1 Knapsack Problem using Markov Chain Monte Carlo techniques, dynamic programming and greedy algorithm.
https://github.com/damascenorafael/mcmc-knapsack-problem

hill-climbing knapsack knapsack-problem markov-chain mcmc metropolis-hastings monte-carlo random-walk simulated-annealing

Last synced: about 2 months ago
JSON representation

Python development to solve the 0/1 Knapsack Problem using Markov Chain Monte Carlo techniques, dynamic programming and greedy algorithm.

• Host: GitHub
• URL: https://github.com/damascenorafael/mcmc-knapsack-problem
• Owner: DamascenoRafael
• License: mit
• Created: 2018-06-01T17:07:27.000Z (over 6 years ago)
• Default Branch: master
• Last Pushed: 2018-07-10T02:24:22.000Z (over 6 years ago)
• Last Synced: 2024-05-02T06:09:22.642Z (8 months ago)
• Topics: hill-climbing, knapsack, knapsack-problem, markov-chain, mcmc, metropolis-hastings, monte-carlo, random-walk, simulated-annealing
• Language: Python
• Homepage:
• Size: 227 KB
• Stars: 4
• Watchers: 4
• Forks: 1
• Open Issues: 0

Awesome Lists containing this project