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