Logo
Explore Help
Sign In
felixm/discrete_optimization
1
0
Fork 0
You've already forked discrete_optimization
Code Issues Pull Requests Packages Projects Releases Wiki Activity
37 Commits 1 Branch 0 Tags
main
Commit Graph

17 Commits

Author SHA1 Message Date
felixm fb4005b74f Change TSP to search closest neighbors. Make lines for plotting thinner and plot neighbor connections. 2020-01-31 14:30:24 -05:00
felixm fb2953bc6f Finish Discrete Optimization. 2020-01-21 22:53:31 -05:00
felixm 3461738861 Precompute and submit solutions. Got 54 with those results. Still bad. 2020-01-20 19:04:03 -05:00
felixm 03291a57bc Divide plane into squares and then local search. 2020-01-20 18:51:47 -05:00
felixm 2bd5774c13 Fix exception when p4 is not initialized. Found 100% solution for problem 4 (and better keep it). 2020-01-16 16:53:36 -05:00
felixm d543cd5d80 Not really any significant improvements. 2020-01-16 16:34:27 -05:00
felixm 955f1def0b Eod. 2020-01-15 13:05:00 -05:00
felixm c690d56cb9 Do not copy for k_opt 2020-01-15 12:10:31 -05:00
felixm 274f8e10db Eod. 2020-01-15 07:13:00 -05:00
felixm efb0f611cf Refactor for better TSP algorithm. 2020-01-14 20:01:23 -05:00
felixm 65fc139e65 Eod. Add clustering, but did not make anything better besides that. 2020-01-12 23:06:01 -05:00
felixm a2f9761517 Full score at graph coloring. 2020-01-11 16:11:01 -05:00
felixm ebeeef29e7 Solve TSP. 2019-12-24 21:21:40 -05:00
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
Powered by Gitea Version: 1.26.2 Page: 54ms Template: 9ms
Auto
English
Bahasa Indonesia Deutsch English Español Français Gaeilge Italiano Latviešu Magyar nyelv Nederlands Polski Português de Portugal Português do Brasil Suomi Svenska Türkçe Čeština Ελληνικά Български Русский Українська فارسی മലയാളം 日本語 简体中文 繁體中文(台灣) 繁體中文(香港) 한국어
Licenses API