Skip to content

Latest commit

 

History

History
4 lines (3 loc) · 224 Bytes

README.md

File metadata and controls

4 lines (3 loc) · 224 Bytes

1-0-Knapsack

A project for my Algorithms for AI class , thate evaluates different algorithmic approaches to the 1/0 Knapsack problem.

Includes two algorithms, a Brute Force implementation and a Branch and Bound approach.