Homepage of the Course: Mathematical Programming, for the PhD in Mathematics

Timetable of the Course

We meet in room A213, in Povo 1 (see map), according to the following timetable.
Monday Tuesday Wednesday Thrsday Friday
4 ore: 9-13
4 ore: 9-13
4 ore: 9-13
4 ore: 9-13
4 ore: 9-13
4 ore: 9-13
4 ore: 9-13
4 ore: 9-13

Program of the Course

  1. Short Program   (As occurring in the manifesto of the PhD program in Mathematics)
  2. Program
  3. Programma (in Italian)

Material for the Course

  1. www site of the book of reference for the LP part of the course

  2. Dynamic Programming (online available sampling chapter from the book on Algorithm by Dasgupta, Papadimitriou and Vazirani)
  3. a good (and free) book on algorithms and complexity
  4. Optimal Trees and Paths (public selection from the 3 cooks' book)
  5. if you want to learn more Combinatorial Optimization than what we can treat in the course Combinatorial Optimization (syllabus of Lex Schrijver's course)

Exercises in programming and problem solving

created:   20 gennaio 2016
updated:   24 gennaio 2016
© Department of Computer Science
University of Verona