IND 311 • Final • Operations Research II
Uzun ve yoğun bir derse hazır ol. Al yanına Unicourse'u, çık bu yola.
Bittiğinde dersi iyi notla geçmek bir yana, dersi anlatmak isteyeceksin!
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 Path Problem
8 topic lessons
What is a network?
Shortest Path Problems
Dijkstra's Algorithm
Example 1
Example 2
Example 3
Example 4
Example 5
Network Models - Maximum Flow Problem
5 topic lessons
Maximum Flow Problems
Minimum Cut
Ford Fulkerson Algorithm
Example 1
Example 2
Project Management
7 topic lessons
What is a project network?
Drawing a Project Network
Example 1
Critical Path Method (CPM)
Example 2
Total & Free Float
Example 3
Dynamic Programming
8 topic lessons
A New Approach to Optimization Problems
Inventory Problems
Example 1
Example 2
Resource Allocation Problems
Example 3
Example 4
Example 5
Past Final Problems
18 questions
Network Models - Shortest Path Problem 1
Network Models - Shortest Path Problem 2
Network Models - Shortest Path Problem 3
Network Models - Shortest Path Problem 4
Network Models - Shortest Path Problem 5
Network Models - Maximum Flow Problem 1
Network Models - Maximum Flow Problem 2
Network Models - Maximum Flow Problem 3
Network Models - Maximum Flow Problem 4
Project Management 1
Project Management 2
Dynamic Programming 1
Dynamic Programming 2
Dynamic Programming 3
Dynamic Programming 4
Dynamic Programming 5
Dynamic Programming 6
Dynamic Programming 7
🦄🦄 Unicourse Special 🦄🦄
8 questions
Network Models - Shortest Path Problem 1
Network Models - Shortest Path Problem 2
Network Models - Maximum Flow Problem 1
Network Models - Maximum Flow Problem 2
Project Management 1
Dynamic Programming 1
Dynamic Programming 2
Dynamic Programming 3
Buy both together
🎓 92% of OSTIM Teknik Üniversitesi students study with the whole bundle.
