|
ECTS:
|
6
|
Lecturers in charge:
|
Prof. dr. sc.
Mario-Osvin Pavčević
|
English level:
1,1,1
|
All teaching activities in the course will be held on English. This level includes courses with multiple groups (i.e., all teaching will be held strictly in Croatian for Croatian groups, and strictly in English for English groups).
|
Description:
|
Combinatorial structures. Combinatorial algorithm design techniques. Analysis of combinatorial algorithms. Generating elementary combinatorial objects (subsets, Gray codes, permutations, set partitions). Backtracking algorithms. The knapsack problem. The traveling salesman problem. The maximum clique problem in graphs. Heuristic search (hill-climbing strategy, simulated annealing, tabu search, genetic algorithms).
|
Literature:
|
- D. L. Kreher, D. R. Stinson, Combinatorial algorithms: Generation, Enumeration and Search, CRC Press, 1999.
- D. Jungnickel, Graphs, Networks and Algorithms, Springer, 1999.
- D. Veljan, Kombinatorna i diskretna matematika, Algoritam, 2001.
|
|
Zimski semester
|
course for
Graduation study
|
|
