Introduction to Operational Research (OR). OR models. Algorithm complexity and NPhard problems. Linear Programming: simplex algorithm, duality theory, transportation problems. Integer Programming: _ranch and bound, set covering and partitioning, dynamic programming, knapsack problem, generalized knapsack problem. Heuristic algorithms: performance evaluation measures, vertex covering, maximal independent subset, upper and lower bounds. Local search methods: neighborhood search methods, the travelling salesman problem, graph partitioning. Simulated annealing: Metropolis algorithm, the maximum cut problem. Applications.
Written examination at the end of the semester and optional tasks.