EPFLx: Optimization: principles and algorithms – Network and discrete optimization
|
Introduction to network optimization 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.
At a Glance:
Institution: EPFLx
Subject: Math
Level: Intermediate
Prerequisites:
The course assumes that you are familiar with linear optimization. We advise you to follow the companion course on that topic if it is not the case.
The knowledge of the programming language Python is an asset to learn the details of the algorithms. However, it is possible to follow the course without programming at all.
Language: English
Video Transcript: English
Associated skills:Discrete Optimization, Shortest Path Problem, Algorithms
User Reviews
Be the first to review “EPFLx: Optimization: principles and algorithms – Network and discrete optimization”
Related Products
UCSanDiegoX: Data Structures Fundamentals
Learn about data structures that are used in computational thinking – both basic and advanced.
DelftX: AI in Practice: Preparing for AI
Learn to recognize and understand the implications of Artificial Intelligence for organizations, and the importance of compliance and ethics when AI is applied in practice.
HarvardX: CS50’s Introduction to Artificial Intelligence with Python
Learn to use machine learning in Python in this introductory course on artificial intelligence.
StanfordOnline: Algorithms: Design and Analysis, Part 1
Welcome to the self paced course, Algorithms: Design and Analysis! Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience.
GTx: Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms
Delve into Pattern Matching algorithms from KMP to Rabin-Karp. Tackle essential algorithms that traverse the graph data structure like Dijkstra’s Shortest Path. Study algorithms that construct a Minimum Spanning Tree (MST) from a graph. Explore Dynamic Programming algorithms. Use the course visualization tool to understand the algorithms and their performance.
GalileoX: Java Programming Fundamentals
Your career as a program developer starts here. Gain entry-level programing skills in Java language, and prepare yourself to handle any task that is required in any programming job.
There are no reviews yet.