Skip to content
/ knapsack-and-max-sat Public

MIE-PAA problems and algorithms. Knapsack problem solutions: brute force, branch and bound, dynamic programming, FPTAS approximation algorithm, Simulated Annealing. MAX-SAT: Simulated Annealing

3 stars 0 forks Branches Tags Activity
Star
Notifications

famer/knapsack-and-max-sat

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits

HW1

HW1

 
 

HW2

HW2

 
 

HW3

HW3

 
 

HW4

HW4

 
 

MAX-SAT

MAX-SAT

 
 

inst

inst

 
 

sol

sol

 
 

README.md

README.md

 
 

knapsack_1.py

knapsack_1.py

 
 

knapsack_2.py

knapsack_2.py

 
 

knapsack_4.py

knapsack_4.py

 
 

maxsat.py

maxsat.py

 
 

Repository files navigation

knapsack-and-max-sat

MIE-PAA problems and algorithms. Knapsack problem solutions: brute force, branch and bound, dynamic programming, FPTAS approximation algorithm, Simulated Annealing. MAX-SAT: Simulated Annealing

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

Readme
Activity

Stars

3 stars

Watchers

3 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages