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
22 Commits 1 Branch 0 Tags
e84f4c6efc9745ea0029a6ab3410f6c8742174fd
Go to file
Clone
Open with VS Code Open with VSCodium Open with Intellij IDEA
Download ZIP Download TAR.GZ Download BUNDLE
Felix Martin e84f4c6efc Implement prune and branch for graph coloring. Already works better than previous solution.
2020-01-09 16:13:47 -05:00
anyint
Finished week 1.
2019-11-24 13:28:23 -05:00
coloring
Implement prune and branch for graph coloring. Already works better than previous solution.
2020-01-09 16:13:47 -05:00
facility
Add support for opening facilities.
2020-01-06 17:18:30 -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
tsp
Solve TSP.
2019-12-24 21:21:40 -05:00
vrp
Replace clock with process_time. Submit works.
2020-01-06 20:25:04 -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
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%
Powered by Gitea Version: 1.25.4 Page: 388ms Template: 54ms
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