IE 331 • Midterm • Mathematical Modeling and Optimization II
Endüstri Mühendisliği'nin belki de en zor konularını bir arada barındıran bu dersten korkmana gerek yok.
Detaylı konu anlatımları ve çok sayıda çözümlü örnekle Unicourse yine yanında!
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.
Topics
Shortest Path Problem
6 topic lessons
What is a network?
Shortest Path Problems
Dijkstra's Algorithm
Example 1
Example 2
Example 3
Maximum Flow Problem
5 topic lessons
Maximum Flow Problems
Minimum Cut
Ford Fulkerson Algorithm
Example 1
Example 2
Minimum Cost Network Flow Problems
8 topic lessons
What is it?
LP Solution
Assignment Problem
Example 1
Shortest Path Problem
Example 2
Maximum Flow Problem
Example 3
Minimum Spanning Tree
4 topic lessons
What is a Minimum Spanning Tree?
Prim's Algorithm
Example 1
Example 2
Integer Programming Modeling
3 topic lessons
What is Integer Programming?
Constraints with Binary Variables
Special Constraints
Important Question Types
7 topic lessons
Fixed Charge Problems
Example 1
Exam-like Question 1
Assignment Problems
Example 2
Set Covering Problems
Example 3
If-then Constraints and More
7 topic lessons
Non-Linear Objectives
Piecewise Linear Example
Absolute Value Example
Max-Min Example
If-then --> Either-or
Example 1
Example 2
Traveling Salesman Problem
4 topic lessons
Problem Definition
MTZ Subtour Elimination
DFJ Subtour Elimination
Example
Branch and Bound Method
8 topic lessons
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 🦄🦄
4 questions
Shortest Path Problem
Minimum Spanning Tree
Integer Programming
Branch and Bound
🦄🦄 Exam Practice: Sınav Provası II 🦄🦄
4 questions
MCNFP
Integer Programming
Integer Programming
Branch and Bound
🦄🦄 Exam Practice: Sınav Provası III 🦄🦄
4 questions
Maximum Flow Problem
Minimum Spanning Tree
Integer Programming
Integer Programming
🦄🦄 Exam Practice: Sınav Provası IV 🦄🦄
4 questions
Shortest Path Problem
Maximum Flow Problem
Integer Programming
Branch and Bound
🦄🦄 Exam Practice: Sınav Provası V 🦄🦄
4 questions
Shortest Path Problem
MCNFP
Integer Programming
Branch and Bound
🦄🦄 Exam Practice: Sınav Provası VI 🦄🦄
4 questions
Maximum Flow Problem
Integer Programming
Integer Programming
Branch and Bound
🦄🦄 Exam Practice: Sınav Provası VII 🦄🦄
4 questions
Maximum Flow Problem
Integer Programming
Integer Programming
Branch and Bound
🦄🦄 Exam Practice: Sınav Provası VIII 🦄🦄
4 questions
Shortest Path Problem
Minimum Spanning Tree
MCNFP
Integer Programming
Reviews
1 student review
Only students who have this course can review it.
Pamir Sarıduman
Bought the courseEndüstri Mühendisliği
Buy both together
🎓 92% of TED Üniversitesi students study with the whole bundle.
