My solutions to the Coursera Discrete Optimization course. Possibly the hardest class I have ever taken.

You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

Felix Martin fb4005b74f Change TSP to search closest neighbors. Make lines for plotting thinner and plot neighbor connections.		3 years ago
anyint	Finished week 1.	4 years ago
coloring	Full score at graph coloring.	3 years ago
facility	Add support for opening facilities.	3 years ago
knapsack	Make depth first search for Knapsack non-recursive and more efficient. Solves all problems in reasonable time now.	4 years ago
tsp	Change TSP to search closest neighbors. Make lines for plotting thinner and plot neighbor connections.	3 years ago
vrp	Change TSP to search closest neighbors. Make lines for plotting thinner and plot neighbor connections.	3 years ago
.gitignore	Continue working on Knapsack.	4 years ago