Links und Funktionen
Sprachumschaltung

Navigationspfad
Sie sind hier: Startseite / Lehre / WS 2009/10 / Oberseminar / Hans Georg Seedig: Network Flow Optimization with Minimum Quantities


Inhaltsbereich

Hans Georg Seedig: Network Flow Optimization with Minimum Quantities

17.11.2009 10:15
Wann 10:15 11:45 17.11.2009
von bis
Wo Z1.09 (neu: L109)
Termin übernehmen vCal
iCal
An unusual kind of constraints had to be treated in a project of a logistic consultant with a european beverage manufacturer. We considered minimum quantities in what was generally a minimum cost network flow problem. This modified problem turned out to be NP-complete and we devised a tailored branch-and-bound algorithm and compared it to a heuristic approach that was used before. 
 
The talk reflects the content of a diploma thesis in mathematics. It comes with a brief introduction to graphs and network flows so that no previous knowledge is required. Students of computer science and mathematics might find this interesting as well.

Artikelaktionen

abgelegt unter:

Funktionsleiste