| TAOP39 | Applied Combinatorial Optimization, ECTS-points /TILLÄMPAD KOMBINATORISK OPTIMERING/ Advancement level: D | |
| Aim: The course aims to give the students a deeper knowledge about combinatorial optimization, i.e. optimization problems with an underlying graph structure, and an insight in how mathematical theory can be used to formulate and solve such problems, with emphasis on applications as distribution planning. Prerequisites: TAOP27 Operations research, extended course (I) or TAOP29 Discrete Optimization (Y).Course organization: In the lectures the theory and algorithms are discussed and exemplified by practical applications. In the seminars the students present scientific papers and in the computer exercises problems are formulated and solved.Course content: (Theory and methodology) Different aspects on problem formulation (problem and algorithm complexity). Relaxations of combinatorial problems. The usage of duality in linear programming. Lagrangean duality and subgradient optimization. Branch-and-bound, cutting plane and constraint generation. Heuristic methods. (Optimization problems) Location problems, Matching and the Postman problem, Traveling salesman problem and Routing problems. The cost allocation problem. Course literature: Information about lecture notes (kompendium) is given at the beginning of the course. | ||
| UPG 1 | ||
| TEN 1 | Written examination | |