Hi, I'd want to bring to the list users attention interesting "Discrete Optimization" course on Coursera site: https://www.coursera.org/course/optimization The course is completely free, the professor is Pascal Van Hentenryck and it's not too late to register and join. Bulk of the course is solving several discrete optimization problems: Knapsack, Graph Coloring, Euclidean TSP, puzzles etc. Instances are large and hard enough to be interesting to solve. Also there is a leaderboard to compare own result with others. Any general-purpose language or solver can be used, and I've successfully used ECLiPSe to solve some of the problems (although ECLiPSe is probably not very well suited to solve large Euclidean TSPs). Sergii.Received on Thu Jun 27 2013 - 21:23:09 CEST
This archive was generated by hypermail 2.3.0 : Wed Sep 25 2024 - 15:13:20 CEST