Optimization: principles and algorithms - Network and discrete optimization
About this Course
Introduction to the mathematical concept of networks, and to two important optimization problems on networks: the transshipment problem and the shortest path problem. Short introduction to the modeling power of discrete optimization, with reference to classical problems. Introduction to the branch and bound algorithm, and the concept of cuts.Created by: École polytechnique fédérale de Lausanne
Level: Intermediate
Related Online Courses
In the first part of this course you will explore methods to compute an approximate solution to an inconsistent system of equations that have no solutions. Our overall approach is to center our... more
At the beginning of this course we introduce the determinant, which yields two important concepts that you will use in this course. First, you will be able to apply an invertibility criterion for a... more
Differential equations are the mathematical language we use to describe the world around us. Most phenomena can be modeled not by single differential equations, but by systems of interacting... more
La aritmética es la rama de la matemática que se dedica al estudio de los números y las operaciones elementales entre ellos. Sin darnos cuenta aplicamos dicha rama en diversas situaciones de nu... more
This exam assesses all concepts, methods and techniques introduced across the four courses within the LSE MicroBachelors program in Mathematics and Statistics Fundamentals: Mathematics 1:... more
Powered by
