Commit Graph

Select branches

Hide Pull Requests

main

Mono Color

• fb4005b74f Change TSP to search closest neighbors. Make lines for plotting thinner and plot neighbor connections. main Felix Martin 2020-01-31 14:30:24 -0500
• fb2953bc6f Finish Discrete Optimization. Felix Martin 2020-01-21 22:53:31 -0500
• cd3d564113 Start VRP. Felix Martin 2020-01-21 15:05:33 -0500
• 3461738861 Precompute and submit solutions. Got 54 with those results. Still bad. Felix Martin 2020-01-20 19:04:03 -0500
• 03291a57bc Divide plane into squares and then local search. Felix Martin 2020-01-20 18:51:47 -0500
• 2bd5774c13 Fix exception when p4 is not initialized. Found 100% solution for problem 4 (and better keep it). Felix Martin 2020-01-16 16:53:36 -0500
• d543cd5d80 Not really any significant improvements. Felix Martin 2020-01-16 16:34:27 -0500
• 955f1def0b Eod. Felix Martin 2020-01-15 13:05:00 -0500
• c690d56cb9 Do not copy for k_opt Felix Martin 2020-01-15 12:10:31 -0500
• 274f8e10db Eod. Felix Martin 2020-01-15 07:13:00 -0500
• efb0f611cf Refactor for better TSP algorithm. Felix Martin 2020-01-14 20:01:23 -0500
• 65fc139e65 Eod. Add clustering, but did not make anything better besides that. Felix Martin 2020-01-12 23:06:01 -0500
• a2f9761517 Full score at graph coloring. Felix Martin 2020-01-11 16:11:01 -0500
• 7142d97257 Searching version. Felix Martin 2020-01-10 19:31:26 -0500
• 607dc88bd3 Eod. Felix Martin 2020-01-09 16:49:01 -0500
• e84f4c6efc Implement prune and branch for graph coloring. Already works better than previous solution. Felix Martin 2020-01-09 16:13:47 -0500
• 126d7103fa Replace clock with process_time. Submit works. Felix Martin 2020-01-06 20:25:04 -0500
• c3d6863ab6 Add support for opening facilities. Felix Martin 2020-01-06 17:18:30 -0500
• 13104943ca Pass facility assignment. Add vrp assignment. Felix Martin 2020-01-06 16:45:48 -0500
• 18a7f784c3 First working solution with local search. Close neighborhood. Felix Martin 2020-01-06 16:27:27 -0500
• 590e6713d1 Implement greedy solution. Reaches 35/80, 56 needed to pass. Felix Martin 2020-01-05 20:48:51 -0500
• 42611d79a5 Add facility assignment problem set. Felix Martin 2019-12-31 10:11:13 -0500
• ebeeef29e7 Solve TSP. Felix Martin 2019-12-24 21:21:40 -0500
• 26d346e60c Implement k-opt. Felix Martin 2019-12-24 14:37:50 -0500
• 19c1515c0e Eod commit. Felix Martin 2019-12-23 17:29:44 -0500
• 7481ee3f0a Eod. Felix Martin 2019-12-22 21:03:24 -0500
• 233c763805 Add TSP problem. Felix Martin 2019-12-22 12:01:00 -0500
• 61e159f50e Pass coloring assignment. Felix Martin 2019-12-16 00:18:45 -0500
• 2e4a045014 Eod. Felix Martin 2019-12-15 23:23:19 -0500
• 9479593281 Add graph coloring assignment. Felix Martin 2019-12-10 19:10:57 -0500
• c21240d9ea Make depth first search for Knapsack non-recursive and more efficient. Solves all problems in reasonable time now. Felix Martin 2019-12-10 12:32:10 -0500
• bb9678a493 Add example problem. Felix Martin 2019-12-10 07:02:58 -0500
• 4a7034225d Continue working on Knapsack. Felix Martin 2019-12-09 16:34:53 -0500
• dc04e489fe Hack my way to pass week 2. Felix Martin 2019-12-08 21:09:01 -0500
• cf4cef7726 Started to implement Knapsack. Felix Martin 2019-12-04 12:50:14 -0500
• fd8ce084e6 Implement dynamic programming solution for Knapsack. Felix Martin 2019-11-26 03:38:28 -0500
• e3a7b12a79 Finished week 1. Felix Martin 2019-11-24 13:28:23 -0500