IE 232 • Final • Operations Research I - Modeling
Telefonu kaldır, herhangi bir üniversiteden bir arkadaşına Operations Research I dersini nasıl geçtiğini ve harf notunu sor.
Sonrasında derste görüşürüz.
599 TL a month, 3 instalments at no extra cost
Instructor

Ö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.
Pass guarantee
We trust our courses. If you prepare for your exams with us and still fail the course, you can get a refund. Terms
Topics
Transportation and Transshipment Problems
15 topic lessons
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 Simplex Method
Example 6
Example 7
Transshipment Problem Definition/LP Solution
Example 8
Assignment Problem
6 topic lessons
Definition / LP Solution
Assumptions of the Problem
Hungarian Method
Hungarian Method: Trouble in Paradise
Hungarian Method Example 1
Hungarian Method Example 2
Network Flow Models: Shortest Path Problem
5 topic lessons
What is a network?
Shortest Path Problems
Dijkstra's Algorithm
Example 1
Example 2
Network Flow Models: Maximum Flow Problem
5 topic lessons
Maximum Flow Problems
Minimum Cut
Ford Fulkerson Algorithm
Example 1
Example 2
Network Flow Models: Minimum Spanning Tree
4 topic lessons
What is a Minimum Spanning Tree?
Prim's Algorithm
Example 1
Example 2
Travelling Salesman Problem
18 topic lessons
Problem Definition
Solving Problem
Enumeration
Example 1
Nearest Neighbor Algorithm
Example 2
Example 3
Example 4
Example 5
Savings Matrix
Savings Heuristic
Example 1
Example 2
Two-Opt Swap
Important Note on Two-Opt Swaps
Two-Opt Heuristic
Example 3
Example 4
Past Final Problems
22 questions
Transportation Problem 1
Transportation Problem 2
Transportation Problem 3
Transportation Problem 4
Transshipment Problem 1
Assignment Problem 1
Assignment Problem 2
Assignment Problem 3
Assignment Problem 4
Assignment Problem 5
Shortest Path Problem 1
Shortest Path Problem 2
Shortest Path Problem 3
Ford Fulkerson Algorithm 1
Maximum Flow Problem 1
Maximum Flow Problem 2
Minimum Spanning Tree 1
Minimum Spanning Tree 2
Travelling Salesman Problem 1
Travelling Salesman Problem 2
Travelling Salesman Problem 3
Travelling Salesman Problem 4
Reviews
1 student review
Only students who have this course can review it.
Sıla Durusoy
Bought the courseEndüstri Mühendisliği
Buy both together
🎓 92% of Çankaya Üniversitesi students study with the whole bundle.
