Search result for Combinatorial optimization Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 7 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Combinatorial Problems and Ant Colony Optimization Algorithm
by Seyedali Mirjalili- 4.7
-
![]()
![]()
![]()
![]()
![]()
5 hours on-demand video
One of the most well-regarded of them is Ant Colony Optimization that allows humans to solve some of the most challenging problems in history. Formulating combinatorial optimization problems Difficulty of combinatorial optimization problems Brute-force (exhaustive) algorithm to solve combinatorial problems Branch and bound algorithm to solve combinatorial problems Inspirations of the Ant Colony Optimization (ACO)...
$13.99
Approximation Algorithms Part I
by Claire Mathieu- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 36 hours to complete
These are examples of NP-hard combinatorial optimization problems. Upon completion, you will be able to recognize, when faced with a new combinatorial optimization problem, whether it is close to one of a few known basic problems, and will be able to design linear programming relaxations and use randomized rounding to attempt to solve your own problem....
Quantum Computing: Theory to Simulation and Programming
by Vinay Phadnis- 4
-
![]()
![]()
![]()
![]()
![]()
4.5 hours on-demand video
Combinatorial Optimisation: This section deals with a fundamental concept in the domain of combinatorial optimisation called as Quadratic Unconstrained Binary Optimisation (QUBO)....
$14.99
Approximation Algorithms Part II
by Claire Mathieu- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 33 hours to complete
Upon completion, you will be able to recognize, when faced with a new combinatorial optimization problem, whether it is close to one of a few known basic problems, and will be able to design linear programming relaxations and use randomized rounding to attempt to solve your own problem....
Optimization with Metaheuristics in Python
by Curiosity for Data Science- 4.4
-
![]()
![]()
![]()
![]()
![]()
10 hours on-demand video
This course will guide you on what optimization is and what metaheuristics are. This course will teach you how to optimize continuous and combinatorial problems using Python The instructor is talented and knowledgeable about the optimization problems. I would appreciate an example of constraint handling for combinatorial problems....
$11.99
Delivery Problem
by Alexander S. Kulikov- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 14 hours to complete
We’ll implement (in Python) together efficient programs for a problem needed by delivery companies all over the world millions times per day — the travelling salesman problem. The goal in this problem is to visit all the given places as quickly as possible. How to find an optimal solution to this problem quickly?...
Probabilistic Graphical Models 2: Inference
by Daphne Koller- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 38 hours to complete
Probabilistic graphical models (PGMs) are a rich framework for encoding probability distributions over complex domains: joint (multivariate) distributions over large numbers of random variables that interact with each other. These representations sit at the intersection of statistics and computer science, relying on concepts from probability theory, graph algorithms, machine learning, and more....
