MIE-PAA problems and algorithms. Knapsack problem solutions: brute force, branch and bound, dynamic programming, FPTAS approximation algorithm, Simulated Annealing. MAX-SAT: Simulated Annealing
-
Notifications
You must be signed in to change notification settings - Fork 0
MIE-PAA problems and algorithms. Knapsack problem solutions: brute force, branch and bound, dynamic programming, FPTAS approximation algorithm, Simulated Annealing. MAX-SAT: Simulated Annealing
famer/knapsack-and-max-sat
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
MIE-PAA problems and algorithms. Knapsack problem solutions: brute force, branch and bound, dynamic programming, FPTAS approximation algorithm, Simulated Annealing. MAX-SAT: Simulated Annealing
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published