Hafta |
Tarih |
Konu |
Ders Notları |
1 |
28 Şubat |
Introduction
Discrete Optimization
Lumpy LPs and Fixed Charges, Knapsack, Capital Budgeting |
(Giriş)
(Tamsayılı
Programlama Notları)
(Swedish
Steel)
(Indy
Car)
(NASA
CApital Budgeting) |
2 |
7 Mart |
Set Packing/Covering/Partitioning, Assignment and
Matching Models |
(EMS)
(Crew)
(Crew_Örnek)
(CAM)
(CDOT) |
3 |
14 Mart |
TSP and Routing
Models |
(TSP
Subtour Elimination)
(TSP
MTZ)
(TSP
MTZ Uygulama) |
4 |
21 Mart |
TSP and Lazy
Constraints |
(TSP) |
5 |
28 Mart |
Vehicle Routing |
(VRP Notları)
(CW
Tasarruf Algoritması)
(Vehicle
Routing)
(Tr
20)
(Data 20)
(Data 60)
(Data 101)
(Data 385) |
6 |
4 Nisan |
Facilities
Location and Network Design |
(Tmark)
(Wastewater)
(Ödev) |
7 |
11 Nisan |
Processor
Scheduling |
(Nifty Notes)
(Custom Metalworking) |
8 |
18 Nisan |
Ara Sınavı |
|
9 |
25 Nisan |
Network Optimization
Maximum Flow |
(Şebeke Optimizasyonu Notları)
(Max Flow)
(ITC ödev)
|
10 |
2 Mayıs |
Min Cost Network
Flows |
(Min Cost Network Transport)
(Min Cost Network Transshipment) |
11 |
9 Mayıs |
Min Spanning Tree |
(Min
Spanning Tree
IP)
(Min
Spanning Tree
Kruskal)
(Min
Spanning Tree
Prim)
(Min
Spanning Tree
Ödev)
|
12 |
16 Mayıs |
Shortest Route |
(Shortest
Path IP)
(Shortest
Path Dijkstra)
(Shortest
Path Floyd)
|
13 |
23 Mayıs |
Sudoku |
(Sudoku_empty) |
14 |
30 Mayıs |
A Reverse
Logistics Network Design Problem |
(Reverse
Logistics Case)
(Reverse
Logistics Template)
(Reverse
Logistics paper) |
15 |
13 Haziran |
Final Sınavı |
|