Lecture

Integer Programming: John's Theorem

Description

This lecture covers the concept of integer programming, focusing on John's Theorem and its application to compute the John ellipsoid for complete shortest vector computations in convex bodies. It also discusses how general integer programming can be reduced to shortest vector computations, highlighting the open problem of solving integer programming as efficiently as for ellipsoids.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.