Program Overview

Operations Research II

Description

This course will introduce a variety of optimization problems with integer variables and constraints. Topics covered include assignment problems, transportation, transshipment problems, network flows problems, and IP algorithms such as Cutting Planes, Branch & Bound. Applications include the Knapsack Problem and the Traveling Salesman Problem. Appropriate Optimization software tools will be used to solve a variety of practical problems.

Course Details

• Course period: 13/01/25
• Topics:
  • Assignment problems
  • Transportation
  • Transshipment problems
  • Network flows problems
  • IP algorithms
    • Cutting Planes
    • Branch & Bound
• Applications:
  • Knapsack Problem
  • Traveling Salesman Problem
• Software tools: Optimization software tools will be used to solve practical problems.