Algorithmic Operations Research

The course covers mathematical decision making models and presents algorithmic techniques for solving them. It focuses on Linear programming and the simplex algorithm, dual theory and transportation problems. In integer programming it describes branch and bound techniques for packing, covering and knapsack problems, and generalized linear programming for cutting stock problems. It describes techniques for algorithms evaluation (empirical evaluation, approximation ratio). It develops Local Search Algorithms and studies the Neighborhood Structure and Neighborhood search methods for the Traveling Salesman (k-OPT neighborhoods), max cut and graph bipartitioning problems .