IE 303 • Tüm Sınavlar • 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.
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 Modeling
3 konu anlatımı
What is Integer Programming?
Constraints with Binary Variables
Special Constraints
Important Question Types
7 konu anlatımı
Fixed Charge Problems
Example 1
Exam Like Question 1
Assignment Problems
Example 2
Set Covering Problems
Example 3
Tricks for Hardest Questions
7 konu anlatımı
Non-Linear Objectives
Piecewise Linear Example
Absolute Value Example
Max-Min Example
If-then --> Either-or
Example 1
Example 2
Branch and Bound Algorithm
6 konu anlatımı
Introduction
Example 1
Example 2
An Important Question
Knapsack Problem and Branch&Bound
Knapsack Problemi B&B Example
Complete (Implicit) Enumeration
4 konu anlatımı
Method
Example 1
Example 2
Example 3
Valid Inequalities and Cutting Planes
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
Cover and Knapsack Problem
5 konu anlatımı
Definition
Cover and Cover Inequality
Example 1
Minimal and Extended Cover
Example 2
🦄 🦄 QUIZ 1 PRACTICE PROBLEMS 🦄 🦄
14 soru
Integer Programming
Integer Programming
Integer Programming
Integer Programming
Integer Programming
Branch and Bound Technique
Branch and Bound Technique
Branch and Bound Technique
Valid Inequality
Ideal Formulation
Gomory Fractional Cutting Plane
Cutting Plane Algorithm
Cover Inequality and Knapsack Problem
Cover Inequality and Knapsack Problem
Network Models - Shortest Path Problem
8 konu anlatımı
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 konu anlatımı
Maximum Flow Problems
Minimum Cut
Ford Fulkerson Algorithm
Example 1
Example 2
🦄 🦄 QUIZ 2 PRACTICE PROBLEMS 🦄 🦄
5 soru
Shortest Path Problem 1
Shortest Path Problem 3
Shortest Path Problem 4
Maximum Flow Problem 1
Maximum Flow Problem 2
Sample Midterm Problems
26 soru
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
Integer Programming 11
Implicit Enumeration 1
Implicit Enumeration 2
Implicit Enumeration 3
Branch and Bound 1
Branch and Bound 2
Branch and Bound 3
Cutting Plane Algorithm
Cover Inequality and Knapsack Problem 2
Cover Inequality and Knapsack Problem 3
Cover Inequality and Knapsack Problem 5
Cover Inequality and Knapsack Problem 6
Shortest Path Problem
Shortest Path Problem
Maximum Flow Problem
Maximum Flow Problem
Spanning Trees
13 konu anlatımı
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 konu anlatımı
Matching
Maximum Cardinality Matching Problem
Example 1
Bipartite Graphs
Minimum Cardinality Covering Problem
Example 2
Traveling Salesman Problem
16 konu anlatımı
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 Practice - II
8 soru
Spanning Trees 1
Spanning Trees 2
Matching and Covering Problems 1
Matching and Covering Problems 2
Matching and Covering Problems 3
Matching and Covering Problems 4
Traveling Salesman Problem 1
Traveling Salesman Problem 2
Dynamic Programming
5 konu anlatımı
A New Approach to Optimization Problems
Inventory Problems
Example 1
Resource Allocation Problems
Example 2
Non-additive (Probabilistic) Dynamic Programming
4 konu anlatımı
What is the difference?
Example 1
Example 2
Example 3
Heuristic Methods
7 konu anlatımı
P v NP
Constructive Heuristics
Improvement Heuristics
Metaheuristics
Simulated Annealing
Genetic Algorithm
Tabu Search
Exam Practice - III
28 soru
Deterministic Dynamic Programming 1
Deterministic Dynamic Programming 2
Deterministic Dynamic Programming 3
Deterministic Dynamic Programming 4
Deterministic Dynamic Programming 5
Deterministic Dynamic Programming 6
Deterministic Dynamic Programming 7
Deterministic Dynamic Programming 8
Deterministic Dynamic Programming 9
Deterministic Dynamic Programming 10
Deterministic Dynamic Programming 11
Deterministic Dynamic Programming 12
Deterministic Dynamic Programming 13
Deterministic Dynamic Programming 14
Probabilistic Dynamic Programming 1
Probabilistic Dynamic Programming 2
Probabilistic Dynamic Programming 3
Probabilistic Dynamic Programming 4
Probabilistic Dynamic Programming 5
Heuristics 1
Heuristics 2
Heuristics 3
Heuristics 4
Heuristics 5
Heuristics 6
Heuristics 7
Heuristics 8
Heuristics 9