IE 3034 • Midterm I • Operations Research II
"Bilirsen yapıyorsun" dedikleri tipte bir ders olan IE 3034'ü bilmek için en iyi adres burası.
Derste anlatılan yöntemleri derinlemesine inceliyoruz, bolca sınava yönelik örnek çözüyoruz.
433 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
Network Models - Shortest Route Problems
8 topic lessons
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 Example 3
Network Models - Minimal Spanning Tree
4 topic lessons
What is a Minimum Spanning Tree?
Prim's Algorithm
MST Example 1
MST Example 2
Network Models - Maximum Flow Problems
5 topic lessons
Maximum Flow Problems
Minimum Cut
Ford Fulkerson Method (Flow Augmenting Path Algorithm)
Ford Fulkerson Method Example 1
Ford Fulkerson Method Example 2
Network Models - Minimum Cost Network Flow Problems
2 topic lessons
Boss of Network Problems
MCNFP Example 1
Network Models - Network Simplex Method
4 topic lessons
Step 1: Finding Initial BFS
Step 2: Finding Entering Variable
Step 3: Finding Leaving Variable & Pivoting
Let's Continue with Iterations
Integer Programming Modeling
6 topic lessons
What is Integer Programming?
Fixed Cost Problems
Fixed Cost Problems Example 1
Exam-like Question 1
Constraints with Binary Variables
Special Constraints
Past Midterm Problems
24 questions
Minimal Spanning Problem 1
Minimal Spanning Problem 2
Minimal Spanning Problem 3
Shortest Route Problems 1
Shortest Route Problems 2
Shortest Route Problems 3
Shortest Route Problems 4
Shortest Route Problems 5
Maximum Flow Problem 1
Maximum Flow Problem 2
Maximum Flow Problem 3
Minimum Cost Flow Problem 1
Minimum Cost Flow Problem 2
Network Simplex Method
Integer Programming 1
Integer Programming 2
Integer Programming 3
Integer Programming 4
Integer Programming 5
Integer Programming 6
Integer Programming 7
Integer Programming 8
Integer Programming 9
Integer Programming 10
Buy both together
🎓 92% of Marmara Üniversitesi students study with the whole bundle.
