On combinatorial optimization
Some optimization problems are practically unsolvable; the algorithms we have
at disposal have enormous running times. Other problems, however, can be solved
Why is it like this? What properties is it that make problems easy to solve, or conversely, difficult to solve? Questions of this type are studied by Hannes Uppman in a recent PhD thesis at IDA about the complexity of combinatorial optimization problems.
D40IT20 jubileum conference
Among the speakers at the D40IT20 jubileum conference there were several alumni
including John Wilander at Apple who travelled from Cupertino, Helena Mischel
from Microsoft, Ulrik Lindblad from SP devices and Petter Weiderholm from
Spotify. There were also presentations by Prof. Tracy Hammond from Texas A&M
University with interests in AI, haptics and situational awareness, and concept
learning, as well as Erik Kruse, marketing strategist from Ericsson who gave an
impression of tomorrow's connected world.
The program was completed with entertainment, cake, and mingle among students, alumni, and faculty members.
Best student Thesis award
The annual prize for Master and Bachelor level theses was awarded in the context of the Jubileum celebration of D40-IT20 with LiU alumni and students from D, IT, and U five year programs. The wining candidates, among five nominated were Viktor Löfgren and Klervie Toszé.
Page responsible: Webmaster