Politecnico di Torino
Politecnico di Torino
   
Login  
it
Politecnico di Torino
Academic Year 2016/17
01RLDPH
Quantitative methods and decision aid
Master of science-level of the Bologna process in Engineering And Management - Torino
Teacher Status SSD Les Ex Lab Tut Years teaching
Della Croce Di Dojola Federico ORARIO RICEVIMENTO PO MAT/09 59 21 0 0 5
SSD CFU Activities Area context
MAT/09 8 D - A scelta dello studente A scelta dello studente
Subject fundamentals
Operations Research consists in building up rational models for the representation of complex problems and in devising the related solution algorithms. Objective of the course is to deepen the student skills on several major topics of operations research with emphasis on computational complexity, combinatorial optimization and multi-criteria analysis.
Expected learning outcomes
At the end of the course the student must be able to determine the computational complexity of given algorithms, to design exact and heuristic algorithms for real world combinatorial optimization problem, to know methods of multi-criteria analysis and use them in relation to specific decision problem situations.
Prerequisites / Assumed knowledge
Bases of operations research with emphasis on linear programming.
Contents
Computational complexity.
Elements of graph theory.
Combinatorial optimization: exact methods, heuristic approaches, approximation algorithms.
Multi-criteria analysis: introduction to multiobjective optimization (pareto-optimality, solution approaches) and to multicriteria outranking methods, ELECTRE methods for sorting decision problems.
Delivery modes
The exercise classes are related to the topics presented in the course. In the laboratories commercial software tools are used to deal with more complex problems.
Texts, readings, handouts and other learning resources
Slides will be provided directly by the teacher.
Reference textbooks that contain part of the topics presented in the course are among others
M.R. Garey, D.S. Johnson (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co.
C.H. Papadimitriou, K. Steiglitz (1982), Combinatorial Optimization. Algorithms and Complexity, Prentice Hall.
V. Vazirani (2001), Approximation Algorithms, Springer.
P. Vincke (1992), Multicriteria decision-Aid, Wiley, Chichester.
L.A. Wolsey (1999), Integer Programming and Combinatorial Optimization, Wiley.
Assessment and grading criteria
Written exam.

Programma definitivo per l'A.A.2016/17
Back



© Politecnico di Torino
Corso Duca degli Abruzzi, 24 - 10129 Torino, ITALY
WCAG 2.0 (Level AA)
Contatti