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
La aritmética y el álgebra son dos de los pilares de las matemáticas que se usan frecuentemente tanto en situaciones de la cotidianidad como en los cursos de matemáticas universitarias. En este MOO... more
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
This course by Imperial College London is designed to help you develop the skills you need to succeed in your A-level further maths exams. You will investigate key topic areas to gain a deeper... more
In this course, we go beyond the calculus textbook, working with practitioners in social, life and physical sciences to understand how calculus and mathematical models play a role in their work.... 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
Powered by
