Search result for Optimization problem Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 137 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Vehicle Routing Problem with Spreadsheet
by Adem AKGÜL- 4.4
-
![]()
![]()
![]()
![]()
![]()
2 hours on-demand video
Optimization of Vehicle Routing Problem Variants In this course, you will learn how to model Vehicle Routing Problem (VRP) on a spreadsheet....
$11.99
Artificial Intelligence #8 : Particle Swarm Optimization
by Sobhan N.- 3.1
-
![]()
![]()
![]()
![]()
![]()
1.5 hours on-demand video
Learn how to solve optimization problem using Particle Swarm Optimization Method Do you like to know the basic theory behind Particle Swarm Optimization Method? Then we go further you will learn how to use python and deap library to solve optimization problem and find Min/Max points for your desired functions....
$9.99
Artificial Intelligence #7 : Genetic Algorithm Optimization
by Sobhan N.- 2.6
-
![]()
![]()
![]()
![]()
![]()
1 hour on-demand video
Learn how to solve optimization problem using Genetic Algorithm Optimization Method Do you like to know the basic theory behind Genetic Algorithm Optimization Method? Then we go further you will learn how to use python and deap library to solve optimization problem and find Min/Max points for your desired functions....
$12.99
Discrete Optimization Data Science Heuristic & Metaheuristic
by Up Degree- 3.3
-
![]()
![]()
![]()
![]()
![]()
3.5 hours on-demand video
Discrete Optimization in Data Science: Heuristic and Metaheuristic Methods This comprises the generic Travelling Salesman Problem (TSP), generic in the sense that most discrete optimization problems can be reduced to the TSP very easily. Nature-inspired metaheuristics give us some excellent ways to solve a discrete optimization problem in an elegant way....
$13.99
Mathematics for economists
by Kirill Bukin- 4.1
-
![]()
![]()
![]()
![]()
![]()
Approx. 26 hours to complete
Generalization of the constrained optimization problem for the n variables case. Example of constrained optimization problem on non-compact set. Constrained optimization problem with inequalities for n-dimensional space. Constrained optimization problem with inequalities. Example of solving constrained optimization problem with inequalities (part 1). Example of solving constrained optimization problem with inequalities (part 2)....
Optimization: principles and algorithms - Network and discrete optimization
by Michel Bierlaire- 0.0
-
![]()
![]()
![]()
![]()
![]()
5 Weeks
Introduction to network optimization and discrete optimization Introduction to the mathematical concept of networks, and to two important optimization problems on networks: the transshipment problem and the shortest path problem. Transhipment: you will learn about the transhipment problem (also called "minimum cost flow problem"), its properties, and some special instances....
$49
Optimization: principles and algorithms - Linear optimization
by Michel Bierlaire- 0.0
-
![]()
![]()
![]()
![]()
![]()
5 Weeks
Formulation: you will learn from simple examples how to formulate, transform and characterize an optimization problem. Constraints: you will learn how to represent the constraints of a linear optimization problem, both from a geometric and algebraic point of views. Duality: you will learn how to derive a companion problem called the "dual"....
$49
Related searches
Business Analytics for Decision Making
by Manuel Laguna- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 9 hours to complete
Since businesses problems often have too many alternative solutions, you will learn how optimization can help you identify the best option. Identifying the Best Options — Optimization Optimization and Decision Making Formulating an Optimization Problem Adding Optimization to a Spreadsheet Model Digital Marketing Application of Optimization Week 3 Application Assignment - Linear Optimization...
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. Difficulty of combinatorial optimization problems Travelling Salesman Problem (TSP) The nearest neighbour to solve the Travelling Salesman Problem Inspirations of the Ant Colony Optimization (ACO) Join 100+ students and start your optimization journey with us....
$13.99
Machine Learning: Unsupervised Learning
by Charles Isbell , Michael Littman , Pushkar Kolhe- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 1 months
Usefulness lesson 4 Feature Transformation Feature Transformation Words like Tesla Principal Components Analysis Independent Components Analysis Cocktail Party Problem Matrix Alternatives lesson 5 Information Theory History -Sending a Message Expected size of the message Information between two variables Mutual information Two Independent Coins Two Dependent Coins Kullback Leibler Divergence lesson 6 Unsupervised Learning Project...
Free
