felixm 03291a57bc Divide plane into squares and then local search.

2020-01-20 18:51:47 -05:00

anyint

Finished week 1.

2019-11-24 13:28:23 -05:00

coloring

Full score at graph coloring.

2020-01-11 16:11:01 -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

Divide plane into squares and then local search.

2020-01-20 18:51:47 -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

S

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%