Page Content
Chair for Software and Algorithms for discrete Optimization
In this area of expertise, we investigate intelligent algorithms for the solution of discrete optimization problems with particular emphasis on practical implementation.
We research network algorithms (e.g., SP, MCF, TSP, STP) and methods for general (integer) optimization problems (e.g., LP, ILP, MILP, MINLP).
Also, we are engaged in modeling and research of solution methods for real-world industrial problems, such as the control and planning of gas, water and telecommunication networks, energy system models, and everything else that seems relevant and exciting to us. How well the methods can be implemented in practice is always important to us, be it on supercomputers (HPSC), graphics cards (GPU), workstations, or systems-on-chips (SoC).
Zusatzinformationen / Extras
Quick Access:
Auxiliary Functions
Seminar SS2020
What are the fastest Network Flow algorithms on modern hardware?3236 L 411
Seminar
Lecturer: Prof. Dr. T. Koch
Period:
from 16.04.2020
Location: MA 609
Enrolment:
from 03.02.2020 00:00 o'clock to 14.04.2020 00:00 o'clock
e-mail query
Website
Course overview (LSF)
Hint:
ADM I and some programming experience required.
Block VL SS2020
Combinatorial Optimization @ Work3236 L 410
Integrierte LV (VL mit UE)
Lecturer: Dr. T. Berthold, Prof. Dr. T. Koch
Period:
14.09.2020 to 26.09.2020
Location: ZIB, Raum 2001, Takustr. 7, 14195 Berlin
Website
Course overview (LSF)