Description

Methodological tools:

• Modeling combinatorial optimization problems


• Linear programming


• Integer linear programming


• Shortest path algorithms


• Minimum spanning tree algorithms


• Network flow algorithms

Applications:

• Routing and traffic


• Network design


• Network connectivity and reliability


• Energy consumption

Finalité

The course is an introduction to operations research tools for network applications. Emphasis will be on model formulations, linear and integer linear programming with the main objective of solving practical applications. The course will also provide an integrated view of algorithms and applications of key network optimization problems including the shortest path problem, the maximum flow problem, the minimum cost flow problem and the minimum spanning tree problem.

Description des modalités d'évaluation

Mini-projects and final exam.

Prérequis

Basic knowledge of data structures and algorithms.