The subject course covers classical and non-classical optimization techniques, including the issues of linear and dynamic programming, multiobjective problem, exact and approximate methods, heuristic algorithms, greedy algorithms, evolutionary algorithms, genetic algorithms, evolutionary strategies, genetic programming, hybrid and swarm algorithms.