felixm/discrete_optimization
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Commit Graph

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