Tadei – Fondamenti di Ottimizzazione

• Other learning material and examples of previous exams will be available on the course website.

Argomenti del programma: 1. Linear programming: modeling techniques, basic concepts of the Simplex method and duality (10% of the course). 2. Computational complexity: problem classes P, NP, NP-complete, and CoNP-complete (5% of the course). 3. Exact optimization methods: Branch and Bound, Cutting Planes, and Dynamic Programming (20% of the course). 4.

• The material related to this course will be made available in electronic format through the didattica Web site. Students will receive also some research papers that describe selected networking problems and provide some solutions.

Argomenti del programma: • How to build mathematical models from real-life problems (9h) • Computational complexity of optimization problems (4,5 h) • Elements of network flows (4,5 h) • Local search heuristics (3h) • Meta-heuristics: Simulated Annealing, Genetic Algorithms, Tabu Search and others (7 h) • Application to networks: (15 h) o Routing problems (5 h) o Topology and capacity planning problems in transport networks (10 h)

• Slides and other learning material provided by the instructor.

Argomenti del programma: - Introduction: Automation, Simulation, Optimization. - Basics of Simulation: modelling and different types of simulation techniques (Continuous, Discrete, Discrete Event). - Discrete Event Simulation. - Techniques for the analysis of the output data of a discrete event simulator. - The fundamentals of the Matlab SimEvents package. - Laboratory exercises: simulate discrete event systems with SimEvents.