Heuristics , 10 op
smat5219
Spring 2010 (3. and 4. period)
Lecturer Yury Nikulin, e-mail yury.nikulin[at]utu.fi
Contents: Finding an optimal solution for many combinatorial optimization problems is hard and computationally time consuming task. The primary objective of this course is not only to introduce efficient practical and theoretical tools for constructing approximation solutions, but also to encourage students to start doing independent research by means of accomplishment a short individual research project, which might potentially have a research merit. This course will train student research and programming skills as well as extend their knowledge in mathematical modelling of real-life problems. A special focus will be put on multiobjective and robust optimization, two significant aspects of dealing with any real-life problem.
Lecturing hours are reserved to give a general introduction and specify individual tasks. The rest time is reserved for self-study and project accomplishment.
Level Advanced studies