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-261: Discrete optimization

Summary

This course is an introduction to linear and discrete optimization.

Warning: This is a mathematics course! While much of the course will be algorithmic in nature, you will still need to be able to prove theorems.

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/discrete-optimization-MATH-261

Moodle Page

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

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

This course is an introduction to linear and discrete optimization.

Warning: This is a mathematics course! While much of the course will be algorithmic in nature, you will still need to be able to prove theorems.

Lectures

Instructor

Friedrich Eisenbrand

Official source

https://edu.epfl.ch/coursebook/en/discrete-optimization-MATH-261

Moodle Page

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

About this result

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Algebra: Linear algebra

Geometry: Euclidean geometry

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Theory of computation: Computational complexity theory

Lectures in this course (65)

Dijkstra's Algorithm Overview Log in to Mediaspace to watch this video

Demonstrates the iterative process of applying Dijkstra's algorithm to find optimal paths.

Linear Programming Duality Log in to Mediaspace to watch this video

Explores the concept of duality in linear programming and its practical implications in optimization.

Convex Polyhedra and Linear Programs Log in to Mediaspace to watch this video

Explores convex polyhedra, linear programs, and their optimization importance.

Linear Inequalities and Equivalent LP Log in to Mediaspace to watch this video

Covers linear inequalities, active constraints, and equivalent linear programs.

Solving Linear Programs: SIMPLEX Method Log in to Mediaspace to watch this video

Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.

Related courses (31)

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

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 ...

MGT-418: Convex optimization

This course introduces the theory and application of modern convex optimization from an engineering perspective. ...

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. ...