INDR 363 • Tüm Sınavlar • Mathematical Programming
INDR 262'de ne kadar rahat ettiğini sen biliyorsun.
Dersi tanıtmamıza gerek var mı gerçekten? Tek bilmen gereken aynı eğitmenden aynı kalitede bu dersi dinleyeceğin.
Ayda 1532 TL, peşin fiyatına 3 taksit
Eğitmen
Ömer Faruk Altun
Co-founder & Head of Education
2011 yılında Endüstri Mühendisliği okumak için başladığım Sabancı Üniversitesi'nden 2018 yılında Bilgisayar Mühendisi olarak mezun oldum. 13 yıldır Altun ismiyle başta Sabancı Üniversitesi olmak üzere çeşitli okullarda Endüstri ve Bilgisayar Mühendisliği alanlarında ders vermekteyim. Unicourse'ta sunduğum derslerin yanında eğitim departmanının da sorumluluğunu üstlenmekteyim.
Konular
Shortest Path Problems
9 konu anlatımı
What is a network?
Shortest Path Problems
Dijkstra's Algorithm: Tablo İle
Example 1
Example 2
Dijkstra's Algorithm: Liste İle
Example 3
Example 4
Example 5
Minimum Spanning Tree Problems
4 konu anlatımı
What is a Minimum Spanning Tree?
Prim's Algorithm
Example 1
Example 2
Maximum Flow Problems
5 konu anlatımı
Maximum Flow Problems
Minimum Cut
Ford Fulkerson Algorithm
Example 1
Example 2
Minimum Cost Network Flow Problems & Network Simplex
12 konu anlatımı
What is it?
LP Solution
Assignment Problem
Example 1
Shortest Path Problem
Example 2
Maximum Flow Problem
Example 3
Network Simplex: General Procedure
Network Simplex: Initial BFS
Network Simplex: Iterations
Network Simplex: Example
Integer Programming
9 konu anlatımı
What is Integer Programming?
Constraints with Binary Variables
Special Constraints
Fixed Charge Problems
Example 1
Assignment Problems
Example 2
Set Covering Problems
Example 3
Branch and Bound Method
8 konu anlatımı
Branch
Bound
Example 1
Example 2
Example 3
What is Knapsack Problem?
B & B Solution of Knapsack Problem
Example 4
🦄🦄 Exam Practice: Sınav Provası I 🦄🦄
6 soru
Shortest Path
Minimum Spanning Tree
Maximum Flow
Minimum Cost Network Flow
Integer Programming
Branch and Bound
🦄🦄 Exam Practice: Sınav Provası II 🦄🦄
6 soru
Shortest Path
Shortest Path
Maximum Flow
Minimum Cost Network Flow
Branch and Bound
Branch and Bound
🦄🦄 Exam Practice: Sınav Provası III 🦄🦄
6 soru
Shortest Path
Maximum Flow
Minimum Cost Network Flow
Integer Programming
Branch and Bound
Branch and Bound
🦄🦄 Exam Practice: Sınav Provası IV 🦄🦄
6 soru
Shortest Path
Maximum Flow
Minimum Cost Network Flow
Integer Programming
Integer Programming
Branch and Bound
🦄🦄 Exam Practice: Sınav Provası V 🦄🦄
6 soru
Shortest Path
Minimum Spanning Tree
Minimum Cost Network Flow
Minimum Cost Network Flow
Integer Programming
Branch and Bound
🦄🦄 Exam Practice: Sınav Provası VI 🦄🦄
6 soru
Shortest Path
Minimum Spanning Tree
Maximum Flow
Minimum Cost Network Flow
Integer Programming
Branch and Bound
🦄🦄 Exam Practice: Sınav Provası VII 🦄🦄
7 soru
Shortest Path
Shortest Path
Shortest Path
Minimum Spanning Tree
Maximum Flow
Minimum Cost Network Flow
Minimum Cost Network Flow
Deterministic Dynamic Programming
7 konu anlatımı
A New Approach to Optimization Problems
Inventory Problems
Inventory Problems Example 1
Resource Allocation Problems
Resource Allocation Problems Example 1
Non-Linear Programming DP Solution Integer
Non-Linear Programming DP Solution Continuous
Stochastic Dynamic Programming
4 konu anlatımı
What is the difference?
Example 1
Example 2
Example 3
Non-Linear Programming - One Variable
9 konu anlatımı
What is NLP?
One Variable Unconstrained Optimization
Convexity
Bisection method
Bisection Method Example 1
Bisection Method Example 2
Newton's method
Newton's Method Example 1
Newton's Method Example 2
Non-Linear Programming - Multiple Variables
4 konu anlatımı
Multivariable Unconstrained Optimization
Convexity
Gradient Search Algorithm
Example 1
KKT Conditions
2 konu anlatımı
KKT Conditions
Example 1
🦄🦄 Exam Practice: Sınav Provası I 🦄🦄
7 soru
Minimum Cost Network Flow
Integer Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Non-Linear Programming
Non-Linear Programming
🦄🦄 Exam Practice: Sınav Provası II 🦄🦄
7 soru
Shortest Path
Dynamic Programming
Dynamic Programming
Dynamic Programming
Non-Linear Programming
Non-Linear Programming
Non-Linear Programming
🦄🦄 Exam Practice: Sınav Provası III 🦄🦄
7 soru
Minimum Cost Network Flow
Dynamic Programming
Dynamic Programming
Dynamic Programming
Non-Linear Programming
Non-Linear Programming
Non-Linear Programming
🦄🦄 Exam Practice: Sınav Provası IV 🦄🦄
7 soru
Shortest Path
Integer Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Non-Linear Programming
Non-Linear Programming
🦄🦄 Exam Practice: Sınav Provası V 🦄🦄
7 soru
Shortest Path
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Non-Linear Programming
Non-Linear Programming
🦄🦄 Exam Practice: Sınav Provası VI 🦄🦄
7 soru
Minimum Spanning Tree
Dynamic Programming
Dynamic Programming
Dynamic Programming
Non-Linear Programming
Non-Linear Programming
Non-Linear Programming
🦄🦄 Exam Practice: Sınav Provası VII 🦄🦄
7 soru
Maximum Flow
Dynamic Programming
Dynamic Programming
Dynamic Programming
Non-Linear Programming
Non-Linear Programming
Non-Linear Programming