logo Insalogo Insa

Operations Research

Objectives


At the end of this module, the student :
Will have understood complexity of algorithms, problems classification (P,NP), polynomial reduction, NP-complete problems
Will know different kinds of graphs, severa classical problems on graphs and solving methods, comparison between several graph representations and algorithms
Will know different kinds of graphs, severa classical problems on graphs and solving methods, comparison between several graph representations and algorithms
Will have understood chains and Markov processes, queuing theory
Will be able to model with linear programming
Will know the simplexe algorithm, duality
Will be able to develop a sensibilty analysis
Will be able to model with an algebric language

Needed prerequisite

 Algorithmic and data structures

Form of assessment

The evaluation of outcome prior learning is made as a continuous training during the semester. According ot the teaching, the assessment will be different: as a written exam, an oral exam, a record, a written report, peers review...