| TAOP19 | Combinatorial Optimization, advanced course, 6 ECTS credits. /Kombinatorisk optimering, fk/ |
||
|
Area of Education: Subject area: |
|||
| Advancement level
(A-D): D
|
|||
| Aim: To gain insight of how technical decision problems can be solved with an optimization methodology. To give practical experience of how technical decision problems can be solved with optimization methods. |
|||
| Prerequisites: (valid for students admitted to programmes within which the course is offered) The basic course in optimization. The projects use theories from courses on other departments. The projects that are possible to choose are thereby governed by the prerequisites. Note: Admission requirements for non-programme students usually also include admission requirements for the programme and threshhold requirements for progression within the programme, or corresponding. |
|||
| Organisation: The course consists of two to three projects, which are solved in a group. The course is not in the timetable. Lectures and guidance support the projects. The contents of the lectures are governed by the project's need. At the seminars the projects are presented and discussed. |
|||
| Course contents: Combinatorial optimization problems in communication networks and distributed computer systems, local search, tabu search, simulated annealing, genetic algorithms, nonlinear programming algorithms, Lagrangian duality, subgradient optimization. |
|||
| Course literature: Depends on the project. |
|||
| Examination: | |||
| Written examination- Laboratory work. |
3,5 p 0,5 p |
||
Course language is . Department offering the course: MAI. Director of Studies: Mathias Henningsson Examiner: Jörgen Blomvall Course Syllabus in Swedish |
|||
|
|
 |
|||||
| ||||||