IE 303 • Final • Modeling and Methods in Optimization
Integer Programming ve türevlerine dair oldukça ayrıntılı konu anlatımları ve çözümlü örneklerle hazırlanmış bu dersle birlikte IE 303 gibi zor bir dersi bile kolay hale getir.
666 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
Network Models - Maximum Flow Problem
5 topic lessons
Maximum Flow Problems
Minimum Cut
Ford Fulkerson Algorithm
Example 1
Example 2
Spanning Trees
13 topic lessons
Graphs and Their Spanning Trees
Example 1
Maximum Weight Spanning Trees
Formulation I
Example 2
Formulation II
Example 3
Greedy Heuristic
Example 4
Minimum Weight Spanning Trees
Example 5
Greedy Heuristic
Example 6
Matching and Covering Problems
6 topic lessons
Matching
Maximum Cardinality Matching Problem
Example 1
Bipartite Graphs
Minimum Cardinality Covering Problem
Example 2
Traveling Salesman Problem
16 topic lessons
Hamiltonian Tours and TSP
2-matching
STSP: 2-matching with Subtour Elimination
Example 1
STSP: 2-matching with Connectivity
Example 2
1-Tree
Example 3
STSP: 2-matching & 1-Tree
Example 4
Finding Optimal 1-Tree
Example 5
Asymmetric Traveling Salesman Problem
ATSP Formulations I & II
Miller-Tucker-Zemlin Formulation
Example 6
🦄🦄 EXAM & QUIZ PRACTICE - PART 1 🦄🦄
13 questions
Maximum Flow Problem
Maximum Flow Problem
Maximum Flow Problem
Maximum Flow Problem
Spanning Trees
Spanning Trees
Spanning Trees
Matching and Covering Problems
Matching and Covering Problems
Matching and Covering Problems
Matching and Covering Problems
Traveling Salesman Problem
Traveling Salesman Problem
Dynamic Programming
5 topic lessons
A New Approach to Optimization Problems
Inventory Problems
Example 1
Resource Allocation Problems
Example 2
Non-additive (Probabilistic) Dynamic Programming
4 topic lessons
What is the difference?
Example 1
Example 2
Example 3
Heuristic Methods
7 topic lessons
P v NP
Constructive Heuristics
Improvement Heuristics
Metaheuristics
Simulated Annealing
Genetic Algorithm
Tabu Search
🦄🦄 EXAM & QUIZ PRACTICE - PART 2 🦄🦄
19 questions
Deterministic DP
Deterministic DP
Deterministic DP
Deterministic DP
Deterministic DP
Deterministic DP
Deterministic DP
Probabilistic DP
Probabilistic DP
Probabilistic DP
Heuristics
Heuristics
Heuristics
Heuristics
Heuristics
Heuristics
Heuristics
Heuristics
Heuristics
Reviews
22 student reviews
Only students who have this course can review it.
Uğur Karabaş
Bought the courseEndüstri Mühendisliği
10 numara
Göktuğ Yılmaz Kösek
Bought the courseEndüstri Mühendisliği
Alp Demir Akın
Bought the courseEndüstri Mühendisliği
Kerem İlker Ayvacı
Bought the courseEndüstri Mühendisliği
Betül Araz
Bought the courseEndüstri Mühendisliği
Arzuv Orazmyradova
Bought the courseEndüstri Mühendisliği
Ozan Arıöz
Bought the courseEndüstri Mühendisliği
Aslı Erkan
Bought the courseEndüstri Mühendisliği
Yiğit Duha Toraman
Bought the courseEndüstri Mühendisliği
Yiğit Duha Toraman
Bought the courseEndüstri Mühendisliği
Buy both together
🎓 92% of Bilkent Üniversitesi students study with the whole bundle.
