Discrete Optimization Data Science Heuristic & Metaheuristic
Discrete Optimization in Data Science: Heuristic and Metaheuristic Methods
3.38 (12 reviews)
95
students
3.5 hours
content
Oct 2019
last update
$19.99
regular price
What you will learn
What is optimization
Some real-life situations where we need to optimize an objective
The mathematical formalism of optimization
How discrete optimization (Combinatorics) differs from continuous optimization
Different approaches to solve a Combinatorics problem, including— The simplest, perfect but slow ‘Brute Force’ method.
The most popular problem in Combinatorics, viz. Travelling Salesman Problem
Other generic problems in discrete optimization, like the Knapsack Problem
How metaheuristic approaches compare to heuristic solutions
The nature-inspired class of metaheuristic approaches
Ant Colony Optimization: its basis, modus operandi, algorithm and flow chart
The R library to implement Ant Colony Optimization and other heuristic solutions
Examples of Travelling Salesman Problems solved through different approaches
Screenshots
Related Topics
2601370
udemy ID
10/11/2019
course created date
10/29/2019
course indexed date
Bot
course submited by