TU Berlin

Combinatorial Optimization & Graph Algorithms group (COGA)Seminar Randomness in Discrete Optimization

COGA 5-Wheel

Page Content

to Navigation

Seminar Randomness in Discrete Optimization

Title: Randomness in Discrete Optimization

Type: Seminar (2 SWS)

Lecturer: Prof. Dr. Andreas Bly

Maximum Number of Participants: max 14

Dates: July 18 and July 19, 2012, 9:30 - 16:00

Place: MA 750

Requirements: ADM 1 and 2


We study the role of randomness in discrete optimization. Topics covered in the seminar will be

  • Randomized algorithms for combinatorial optimization problems with deterministic input data
  • The role of randomization in complexity theory
  • Methods for stochastic discrete optimization

Each participant will present a lecture and a written exposé (only master and diploma students) on a selected topic. Topics will be assigned at the beginning of the summer term. Interested students can pre-register via .

Date for assignment of topics: April 20, 2012, 13:00, MA 517

Criteria for the "Seminarschein":

  • Lecture and presentation of the topic
  • Written exposé (master and diploma students only)
  • Mandatory meeting with supervisor before 22-JUNE-2012, at least 3 questions related to topic are mandatory

Seminar website with most recent infos</ul>


Quick Access

Schnellnavigation zur Seite über Nummerneingabe