Ruprecht-Karls-Universität Heidelberg
Siegel der Universität Heidelberg

Module for [Scientific Computing]

[back] to List of Modules.

[Efficient Algorithms 2] - [2015 Sommer]

Module Code
IEA2
Name
Efficient Algorithms 2
Credit Points
8 LP CP
Workload
240 h
Duration
ein Semester
Cycle
0
Methods Lecture 2 h + Exercise course 2 h
Objectives
Content NP-hard optimization problems Approximative algorithms and heuristics Relaxations Branch-and-bound algorithms Dynamic programming Integer programming Polyhedral combinatorics Column generation and decomposition Traveling salesman problem Max-cut problem
Learning outcomes The participants can classify easy and hard problems, known the full spectrum of algorithms in combinatorial optimization, are able to model and solve difficult application problems with appropriate algorithms.
Prerequisitesnone
Suggested previous knowledge IPI, IPK, IAD
IEA1
Assessments Solution of 50 percent of the assignments and written exam
Literature z.B. Korte, B., Vygen, J.: Kombinatorische Optimierung, Springer, 2007
Nemhauser, G.L., Wolsey, L.A.: Integer Combinatorial Optimization, Wiley, 1988
zum Seitenanfang