The optimisation methods used are :
-
Brute force,
-
Basic branch and bound,
-
Advanced branch and bound,
-
Dynamic programming
-
Gradient descent
-
Newton descent
-
Notifications
You must be signed in to change notification settings - Fork 1
b1sakher/Using-optimisation-methods-to-solve-the-Knap-sack-Problem
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The optimisation methods used are : Brute force, Basic branch and bound, Advanced branch and bound, Dynamic programming
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published