IE 312 • Tüm Sınavlar • Operations Research II
Bu dersi alan arkadaşlarınıza sormanız yeterli olacaktır.
Ayda 1666 TL, peşin fiyatına 3 taksit
Eğitmen
Ö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.
Konular
Integer Programming
13 konu anlatımı
What is Integer Programming?
Fixed Cost Problems
Example 1
Example 2
Constraints with Binary Variables
Special Constraints
Assignment Problems
Example 3
Set Covering Problems
Example 4
If-then --> Either-or
Example 5
Example 6
Travelling Salesman Problem
4 konu anlatımı
Problem Definition
MTZ Subtour Elimination
DFJ Subtour Elimination
Example
Branch and Bound Method
8 konu anlatımı
Branch
Bound
Example 1
Example 2
Example 3
What is Knapsack Problem?
B & B Solution of Knapsack Problem
Example 4
Cutting Plane Algorithm
8 konu anlatımı
Valid Inequalities
Example 1
Chvàtal Gomory Rounding Procedure
Cutting Plane and Ideal Formulation
Gomory Fractional Cutting Plane
Cutting Plane Algorithm
Example 2
Example 3
gurobipy
10 konu anlatımı
What is Gurobi?
Constructing Model
Defining Input Parameters
Adding Variables
Adding Constraints - Part I
quicksum
Adding Constraints - Part II
Defining Objective Function
Solving Model
Printing Output
🦄🦄 Exam Practice: Sınav Provası I 🦄🦄
5 soru
Modeling
Modeling
Branch and Bound
Cutting Plane
gurobipy
🦄🦄 Exam Practice: Sınav Provası II 🦄🦄
5 soru
Modeling
Modeling
Branch and Bound
Cutting Plane
gurobipy
🦄🦄 Exam Practice: Sınav Provası III 🦄🦄
5 soru
Modeling
Modeling
Branch and Bound
Branch and Bound
Cutting Plane
🦄🦄 Exam Practice: Sınav Provası IV 🦄🦄
5 soru
Modeling
Modeling
Branch and Bound
Cutting Plane
gurobipy
🦄🦄 Exam Practice: Sınav Provası V 🦄🦄
5 soru
Modeling
Modeling
Branch and Bound
Cutting Plane
gurobipy
Shortest Path Problems
6 konu anlatımı · 4 soru
What is a network?
Shortest Path Problems
Dijkstra's Algorithm
Example 1
Example 2
Example 3
Shortest Path Problem
Shortest Path Problem
Shortest Path Problem
Shortest Path Problem
Shortest Path Problems
6 konu anlatımı
What is a network?
Shortest Path Problems
Dijkstra's Algorithm
Example 1
Example 2
Example 3
Maximum Flow Problems
5 konu anlatımı
Maximum Flow Problems
Minimum Cut
Ford Fulkerson Method
Example 1
Example 2
Minimum Cost Network Flow Problems
9 konu anlatımı
What is it?
LP Solution
DİKKAT!!! İZLEMEDEN GEÇME!!!
Assignment Problem
Example 1
Shortest Path Problem
Example 2
Maximum Flow Problem
Example 3
Project Network
7 konu anlatımı
What is a project network?
Drawing a Project Network
Example 1
Critical Path Method (CPM)
Example 2
Total & Free Float
Example 3
Python - Network Problems
6 konu anlatımı
Shortest Path - networkx
Maximum Flow - networkx
Project Network - networkx
Shortest Path - Gurobi
Maximum Flow - Gurobi
Minimum Cost Network Flow - Gurobi
Dynamic Programming Preliminaries
1 konu anlatımı
A New Approach to Optimization Problems
🦄🦄 Exam Practice: Sınav Provası I 🦄🦄
4 soru
Shortest Path Problem + Python
Maximum Flow Problem
Minimum Cost Network Flow
Project Network
🦄🦄 Exam Practice: Sınav Provası II 🦄🦄
4 soru
Modeling
Shortest Path Problem
Maximum Flow Problem + Python
Dynamic Programming Preliminaries
🦄🦄 Exam Practice: Sınav Provası III 🦄🦄
4 soru
Shortest Path Problem
Maximum Flow Problem
Minimum Cost Network Flow
Project Network
🦄🦄 Exam Practice: Sınav Provası IV 🦄🦄
4 soru
Shortest Path Problem
Maximum Flow Problem
Minimum Cost Network Flow
Project Network + Python
🦄🦄 Exam Practice: Sınav Provası V 🦄🦄
4 soru
Shortest Path Problem
Maximum Flow Problem
Minimum Cost Network Flow + Python
Dynamic Programming Preliminaries
Deterministic Dynamic Programming
5 konu anlatımı
A New Approach to Optimization Problems
Inventory Problems
Example 1
Resource Allocation Problems
Example 2
Probabilistic Dynamic Programming
4 konu anlatımı
What is the difference?
Example 1
Example 2
Example 3
Heuristics
7 konu anlatımı
P v NP
Constructive Heuristics
Improvement Heuristics
Metaheuristics
Simulated Annealing
Genetic Algorithm
Tabu Search
🦄🦄 Exam Practice: Sınav Provası I 🦄🦄
6 soru
Modeling
Cutting Plane
Deterministic Dynamic Programming
Deterministic Dynamic Programming
Probabilistic Dynamic Programming
Heuristics
🦄🦄 Exam Practice: Sınav Provası II 🦄🦄
6 soru
Shortest Path Problem
Deterministic Dynamic Programming
Deterministic Dynamic Programming
Probabilistic Dynamic Programming
Heuristics
Heuristics
🦄🦄 Exam Practice: Sınav Provası III 🦄🦄
6 soru
gurobipy
Branch and Bound
Deterministic Dynamic Programming
Deterministic Dynamic Programming
Probabilistic Dynamic Programming
Heuristics
🦄🦄 Exam Practice: Sınav Provası IV 🦄🦄
6 soru
Modeling
Shortest Path Problem
Deterministic Dynamic Programming
Deterministic Dynamic Programming
Probabilistic Dynamic Programming
Heuristics
🦄🦄 Exam Practice: Sınav Provası V 🦄🦄
6 soru
Shortest Path Problem
Deterministic Dynamic Programming
Deterministic Dynamic Programming
Deterministic Dynamic Programming
Heuristics
Heuristics
🦄🦄 Exam Practice: Sınav Provası VI 🦄🦄
6 soru
Branch and Bound
Maximum Flow Problem
Deterministic Dynamic Programming
Deterministic Dynamic Programming
Probabilistic Dynamic Programming
Heuristics