felixm c21240d9ea Make depth first search for Knapsack non-recursive and more efficient. Solves all problems in reasonable time now.

2019-12-10 12:32:10 -05:00

anyint

Finished week 1.

2019-11-24 13:28:23 -05:00

knapsack

Make depth first search for Knapsack non-recursive and more efficient. Solves all problems in reasonable time now.

2019-12-10 12:32:10 -05:00

.gitignore

Continue working on Knapsack.

2019-12-09 16:34:53 -05:00

discrete_optimization.sublime-project

Started to implement Knapsack.

2019-12-04 12:50:14 -05:00

S

Description

My solutions to the Coursera Discrete Optimization course. Possibly the hardest class I have ever taken.

7.7 MiB

Languages

Python 98.3%

Java 1.7%