Lecture

Integer Optimization: Theory and Applications

Description

This lecture covers the fundamentals of integer optimization, including integer programming, dynamic programming, approximation algorithms, and set-cover problems. The instructor discusses the complexity of integer programming, the linear programming relaxation, branch & bound, and the knapsack problem. The lecture also explores topics such as Steinitz Lemma, GCD, Euclidean Algorithm, lattices, Minkowski's Theorem, and transference bounds. Additionally, the lecture delves into the application of integer programming in fixed dimension and algorithms for the Shortest Vector Problem (SVP).

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.