Commit Graph

14 Commits

Author SHA1 Message Date
felixm 26d346e60c Implement k-opt. 2019-12-24 14:37:50 -05:00
felixm 19c1515c0e Eod commit. 2019-12-23 17:29:44 -05:00
felixm 7481ee3f0a Eod. 2019-12-22 21:03:24 -05:00
felixm 233c763805 Add TSP problem. 2019-12-22 12:01:00 -05:00
felixm 61e159f50e Pass coloring assignment. 2019-12-16 00:18:45 -05:00
felixm 2e4a045014 Eod. 2019-12-15 23:23:19 -05:00
felixm 9479593281 Add graph coloring assignment. 2019-12-10 19:10:57 -05:00
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
felixm bb9678a493 Add example problem. 2019-12-10 07:02:58 -05:00
felixm 4a7034225d Continue working on Knapsack. 2019-12-09 16:34:53 -05:00
felixm dc04e489fe Hack my way to pass week 2. 2019-12-08 21:09:01 -05:00
felixm cf4cef7726 Started to implement Knapsack. 2019-12-04 12:50:14 -05:00
felixm fd8ce084e6 Implement dynamic programming solution for Knapsack. 2019-11-26 03:38:28 -05:00
felixm e3a7b12a79 Finished week 1. 2019-11-24 13:28:23 -05:00