Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Graph
Search

Course

MATH-504: Integer optimisation

Summary

The course aims to introduce the basic concepts and results of integer optimization with special emphasis on algorithmic problems on lattices that have proved to be important in theoretical computer science and cryptography during the past 30 years.

Lectures

Instructor

Friedrich Eisenbrand

Friedrich Eisenbrand's main research interests lie in the field of discrete optimization, in particular in algorithms and complexity, integer programming, geometry of numbers, and applied optimization. He is best known for his work on efficient algorithms for integer programming in fixed dimension and the theory of cutting planes, which are an important tool to solve large scale industrial optimization problems in practice. Before joining EPFL in March 2008, Friedrich Eisenbrand was a full professor of mathematics at the University of Paderborn. Friedrich received the Heinz Maier-Leibnitz award of the German Research Foundation (DFG) in 2004 and the Otto Hahn medal of the Max Planck Society in 2001.

Official source

https://edu.epfl.ch/coursebook/en/integer-optimisation-MATH-504

Moodle Page

http://go.epfl.ch/MATH-504

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.

Summary

Lectures

Instructor

Friedrich Eisenbrand

Official source

https://edu.epfl.ch/coursebook/en/integer-optimisation-MATH-504

Moodle Page

http://go.epfl.ch/MATH-504

About this result

Ontological neighbourhood

Theoretical computer science

Theory of computation: Computational complexity theory

Lectures in this course (31)

Integer Optimization: Theory and Applications Log in to Mediaspace to watch this video

Covers the fundamentals of integer optimization, including integer programming, dynamic programming, and approximation algorithms.

Linear and Integer Programming Log in to Mediaspace to watch this video

Covers the theory of linear and integer programming, focusing on the integer hull and rational polyhedra.

Dynamic Programming: Integer Programming Log in to Mediaspace to watch this video

Covers integer programming, dynamic programming, and optimal solutions complexity.

Steinitz Lemma and Cycles Log in to Mediaspace to watch this video

Explores the Steinitz Lemma and the concept of cycles in linear algebra.

Dynamic Programming: Steinitz Sequence Log in to Mediaspace to watch this video

Explores dynamic programming with the Steinitz sequence to optimize solutions efficiently.

Related courses (30)

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, disc ...

CS-450: Algorithms II

A first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a repertory of basic algorithmic solutions to problems in many ...

EE-556: Mathematics of data: from theory to computation

This course provides an overview of key advances in continuous optimization and statistical analysis for machine learning. We review recent learning formulations and models as well as their guarantees

PHYS-467: Machine learning for physicists

Machine learning and data analysis are becoming increasingly central in sciences including physics. In this course, fundamental principles and methods of machine learning will be introduced and practised. ...

COM-401: Cryptography and security

This course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how they work and sketch how they can be implemented. ...