b1sakher / Using-optimisation-methods-to-solve-the-Knap-sack-Problem

The optimisation methods used are : Brute force, Basic branch and bound, Advanced branch and bound, Dynamic programming

Using optimisation methods to solve the Knap sack Problem

The optimisation methods used are :

• Brute force,

• Basic branch and bound,

• Advanced branch and bound,

• Dynamic programming

• Gradient descent

• Newton descent