Siz istediniz, biz hazırladık! INDR 262 dersinin devamı niteliğinde olan INDR 363 sizlerle ! Derste bulunan her konudan geçmiş senelerde çözülen örnekler ve çıkmış sorular baz alınarak hazırlanmış 20 saatin üzerinde içeriğiyle bu dersimizle sınava en hazır şekilde girin.
Dersin içeriğinde bulunan 1) Transportation Problem & Transportation Simplex 2) Assignment Problem & Hungarian Method 3) Transshipment Problem 4) Shortest Path Problem & Dijkstra's Algorithm 5) Minimum Spanning Tree 6) Maximum Flow Problem & Flow Augmenting Path Algorithm 7) Minimum Cost Network Flow Problem & Network Simplex Algorithm 8) Deterministic & Stochastic Dynamic Programming konuları ile hem sınava hazırlanın hem de Quiz ve ödevlerinizde rahat edin!
Transportation and Assignment Problems: Finding Initial Solution for Transportation Problem
Definition / LP Solution
Assumptions of the Problem
Least Cost Method
Example 1
Example 2
Northwest Corner Method
Example 3
Example 4
Vogel's Method
Example 5
Transportation and Assignment Problems: Transportation Simplex
Transportation Simplex Method
Example 1
Example 2
Exam Like Question 1
Transportation and Assignment Problems: Assignment Problem
Definition / LP Solution
Assumptions of the Problem
Hungarian Method
Hungarian Method: Trouble in Paradise
Example 1
Example 2
Exam Like Question 1
Transportation and Assignment Problems: Transshipment Problem
Transshipment Problem Definition/LP Solution
Example 1
Exam Like Question 1
Network Optimization: Shortest Path Problems
What is a network?
Shortest Path Problems
Dijkstra's Algorithm
Djikstra's Algorithm Example 1
Djikstra's Algorithm Example 2
Shortest Path Problem Example 1
Shortest Path Problem Example 2
Shortest Path Problem Exam Like Question 1
Shortest Path Problems True/False Exam Like Question 1
Shortest Path Problems True/False Exam Like Question 2
Network Optimization: Minimum Spanning Tree
What is a Minimum Spanning Tree?
Prim's Algorithm
Example 1
Example 2
Exam Like Question 1
True/False Exam Like Question
Network Optimization: Maximum Flow Problem
Maximum Flow Problems
Minimum Cut
Ford Fulkerson Method (Flow Augmenting Path Algorithm)
Example 1
Example 2
Exam Like Question 1
Network Optimization: Minimum Cost Network Flow Problem (MCNFP)
Boss of Network Problems
MCNFP Example 1
MCNFP Exam Like Question 1
MCNFP Exam Like Question 2
Network Optimization: Network Simplex Method
Step 1: Finding Initial BFS
Step 2: Finding Entering Variable
Step 3: Finding Leaving Variable & Pivoting
Let's Continue with Iterations
Exam Like Question 1
Dynamic Programming: Deterministic
A New Approach to Optimization Problems
Inventory Problems
Inventory Problems Example 1
Inventory Problems Exam Like Question 1
Inventory Problems Exam Like Question 2
Resource Allocation Problems
Resource Allocation Problems Example 1
Resource Allocation Problems Exam Like Question 1
Resource Allocation Problems Exam Like Question 2
Knapsack Problem Exam Like Question 1
Non-Linear Programming DP Solution Integer Case
Non-Linear Programming DP Solution Continuous Case
NLP Integer Case Exam Like Question
NLP Continuous Exam Like Question
Dynamic Programming: Stochastic
What is the difference?
Example 1
Example 2
Example 3
Exam Like Question 1
Exam Like Question 2
Before Exam Questions
Transportation Simplex 1
Transportation Simplex 2
Transportation Simplex 3
Transportation Simplex 4
Assignment Problem 1
Assignment Problem 2
Assignment Problem 3
Shortest Path Problem 1
Shortest Path Problem 2
Shortest Path Problem 3
Minimum Spanning Tree 1
Maximum Flow Problem 1
Maximum Flow Problem 2
Dynamic Programming 1
Dynamic Programming 2
Dynamic Programming 3
Dynamic Programming 4
Dynamic Programming 5
Dynamic Programming 6
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. Şu anda UALR'da Information Science doktora eğitimimi sürdürüyorum. 7 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.
Toplam:₺1599.99₺1999.98%20 indirim
₺999.99