3 Credit Hour Course
Intended For Level 0 Term 0 Students
Prerequisite:
Introduction to Optimization; Linear Programming: Different forms, Simplex Method, Primal-Dual theory; Max-Flow: The Max-Flow-Min-Cut Theorem, Ford-Fulkerson Labeling Algorithm, Dijkstra's Algorithm, The Floyd-Warshall Algorithm; Some Network Flow Algorithms: The Minimum Cost Network Flow Method, Transportation Problem; Capacitated Transportation Problem, Assignment Problem; Integer Linear Programming; Relaxation; Cutting-Plane Algorithm; Branch and Bound Technique; Dynamic Programming; NP-Completeness; TSP and Heuristics; Approximation.
