Packing my $\mathcal{NP}$-complete suitcase(s)

Abstract: Have you ever wondered why packing your infinite amount of suitcases optimally can be such a time-consuming task? Or perhaps you have simply enjoyed a game of Tetris at one point in your life? In any case, you have most likely poked your head into the world of packing problems before. And while these problems are intuitively quite simple, the underlying truth is that they all hide some disturbing secret. Join me in this talk where we will see what a packing problem actually is, and why they are such a mess in practice.

Mathematics

Audience: general audience

Gothenburg PhD seminar

Series comments: Rooms and times may vary, please check the latest update. In-person only.