Discrete optimization algorithms. For each of the three famous problems here, 5 examples are provided to test discrete optimization algorithms efficiency (at least their implementation...).
To launch a task solver, type in command line python get_shortest_paths.py task1_test[k].txt with [k] as the number of the sample used.
To solve the instance, do python knapsack.py task2_test[k].txt
If you have time to kill, just launch python tsp.py task3_test[k].txt :)