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.

Official source

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.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.