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
A wondrously romantic belief is that brilliant thinkers magically produce brilliant ideas: Einstein jostles his hair and relativity falls out. We can enjoy these fanciful visions of leaps of... more
This course is about the Laplace Transform, a single very powerful tool for understanding the behavior of a wide range of mechanical and electrical systems: from helicopters to skyscrapers, from... more
Nous introduisons les fonctions réelles d'une variable réelle. Nous commençons par définir certaines de leurs propriétés, notamment la monotonie, la parité et la périodicité ainsi que les opératio... 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
This course is part of Global Freshman Academy (GFA), which means you can earn transferable ASU credit toward your college degree. In this college level Algebra course, you will learn to apply... more
Powered by
