days and tasks | Lecture Contents: | textbook
sections |
---|---|---|
Sep 09 | Introduction to the course.
What are combinatorial structures, combinatorial algorithms and combinatorial problems? |
Course outline.
Parts of Chapter 1. |
Sep 16 (A1 out) | Combinatorial Generation: (ranking, unranking, successor) for
|
2.1,2.2,2.3.1 |
Sep 23 | Combinatorial Generation: (ranking, unranking, successor) for
|
2.3.3,2.4.1,2.4.2 |
Oct 30 | Exhaustive Generation:
|
4.1,4.2,4.3,4.3.1 |
Oct 7 (A1 in/A2 out) | Exhaustive Generation:
|
4.4, 4.5 |
Oct 14
|
Exhaustive Generation: branch and bound
Bounding functions (maximum clique,Knapsack) Branch-and-bound and TSP |
4.6, 4.6.1, 4.6.3,4.7 |
Oct 21 | Heuristic Search | 5 |
Oct 28
(project proposal in, A2 in/A3 out) |
Heuristic Search | 5 |
Nov 04 | Heuristic search | 5 |
Nov 11 | Computing isomorphism | 7 |
Nov 18 | Computing isomorphism/Isomorph-free generation | 7/papers |
Nov 25
(A3 in) |
Isomorph-free generation | papers |
Extra day TBA | project presentations | - |