This paper considers the polyhedral results and the min–max results on packing and covering problems of the decade. Since the strong perfect graph theorem (published in 2006), the main such results are available for the packing problem, however there are still important polyhedral questions...