|
|
|
Week
#1
|
|
|
Wed,
September 7
|
Lecture
# 1: Combinatorial Algorithms - Sets and Lists
|
|
Fri,
September 9
|
Lecture
# 2: Combinatorial Structures - Graphs and Set Systems
|
|
Week
#2
|
|
|
Mon,
September 12
|
Lecture
# 3: Set Systems - Combinatorial Problems - Knapsack Problem
|
|
Wed,
September 14
|
Lecture
# 4: O-Notation - Analysis of Algorithms - Complexity Classes
|
|
Thu,
September 15
|
Tutorials
Begin, Assignment #1 Available
|
|
Fri,
September 16
|
Lecture
# 5: Data Structures
|
|
Week
#3
|
|
|
Mon,
September 19
|
Lecture
# 6: Algorithm Design Techniques
|
|
Wed,
September 21
|
Lecture
# 7: Comutational Generations - Subsets
|
|
Fri,
September 23
|
Lecture # 8: Gray Codes
|
|
Week
#4
|
|
|
Mon,
September 26
|
Lecture
# 9: k-Element Subsets - Lexicographic Ordering
|
|
Wed,
September 28
|
Lecture
#10: k-Element Subsets - Revolving Door Ordering
|
|
Thu,
September 29
|
Assignment
#1 Due; Assignment #2 Available
|
|
Fri,
September 30
|
Lecture
#11: Permutations - Lexicographic Ordering
|
|
Week
#5
|
|
|
Mon,
October 3
|
Lecture
#12: Permutations - Trotter - Johnson Algorithm
|
|
Wed,
October 5
|
Lecture
#13: Integer Partitions
|
|
Fri,
October 7
|
Lecture #14: Integer Partitions - Lexicographic Ordering
|
|
Week
#6
|
|
|
Mon,
October 10
|
THANKSGIVING
DAY
|
|
Wed,
October 12
|
Lecture
#15: Backtracking Algorithm - Introduction
|
|
Thu,
October 13
|
Assignment
#2 Due; Assignment #3 Available
|
|
Fri,
October 14
|
Lecture
#16: A General Backtracking Algorithm
|
|
Week
#7
|
|
|
Mon,
October 17
|
Lecture
#17: Generating All Cliques - Average-Case Analysis
|
|
Wed,
October 19
|
Lecture
#18: Bounding Functions
|
|
Fri,
October 21
|
Lecture
#19: The Knapsack Problem
|
|
Week
#8
|
|
|
Mon,
October 24
|
Lecture
#20: Traveling Salesman Problem
|
|
Wed,
October 26
|
Lecture
#21: Review
|
|
Thu,
October 27
|
Assignment
#3 Due; Assignment #4 Available
|
|
Fri,
October 28
|
Lecture
#22: Review
|
|
Week
#9
|
|
|
Mon,
October 31
|
Lecture
#23: MIDTERM
|
|
Wed,
November 2
|
Lecture
#24: Traveling Salesman Problem
|
|
Fri, November
4
|
Lecture #25: Maximum Clique Problem
|
|
Week
#10
|
|
|
Mon,
November 7
|
Lecture
#26: Sampling and Greedy Bounds
|
|
Wed,
November 9
|
Lecture
#27: Branch and Bound
|
|
Thu, November
10
|
Assignment
#4 Due; Assignment #5 Available
|
|
Fri,
November 11
|
REMEMBERANCE DAY
|
|
Week
#11
|
|
|
Mon,
November 14
|
Lecture
#28: Introduction to Heuristic Algorithms
|
|
Wed,
November 16
|
Lecture
#29: Uniform Graph Partitions
|
|
Fri,
November 18
|
Lecture #30: Hill-Climing - Simulated Annealing
|
|
Week
#12
|
|
|
Mon,
November 21
|
Lecture
#31: Tabu Search
|
|
Wed,
November 23
|
Lecture #32: Genetic Algorithms
|
|
Thu, November
24
|
Assignment
#5 Due
|
|
Fri,
November 25
|
Lecture
#33: Two Heuristic Algorithms for the Knapsack Problem
|
|
Week
#13
|
|
|
Mon,
November 28
|
Lecture
#34: A Genetic Algorithm for the Traveling Salesman Problem
|
|
Wed,
November 30
|
Lecture
#35: Review
|
|
Fri, December
2
|
Lecture
#36: Review
|
|
Week
#14
|
|
|
Mon, December
5
|
Lecture
#37: Review
|
[
Return to Math 343 Page
]
|