Studying at the University of Verona

Here you can find information on the organisational aspects of the Programme, lecture timetables, learning activities and useful contact details for your time at the University, from enrolment to graduation.

Academic calendar

The academic calendar shows the deadlines and scheduled events that are relevant to students, teaching and technical-administrative staff of the University. Public holidays and University closures are also indicated. The academic year normally begins on 1 October each year and ends on 30 September of the following year.

Academic calendar

Course calendar

The Academic Calendar sets out the degree programme lecture and exam timetables, as well as the relevant university closure dates..

Definition of lesson periods
Period From To
I semestre Oct 1, 2018 Jan 31, 2019
II semestre Mar 4, 2019 Jun 14, 2019
Exam sessions
Session From To
Sessione invernale d'esame Feb 1, 2019 Feb 28, 2019
Sessione estiva d'esame Jun 17, 2019 Jul 31, 2019
Sessione autunnale d'esame Sep 2, 2019 Sep 30, 2019
Degree sessions
Session From To
Sessione di laurea estiva Jul 22, 2019 Jul 22, 2019
Sessione di laurea autunnale Oct 15, 2019 Oct 15, 2019
Sessione di laurea autunnale straordinaria Nov 21, 2019 Nov 21, 2019
Sessione di laurea invernale Mar 19, 2020 Mar 19, 2020
Holidays
Period From To
Sospensione attività didattica Nov 2, 2018 Nov 3, 2018
Vacanze di Natale Dec 24, 2018 Jan 6, 2019
Vacanze di Pasqua Apr 19, 2019 Apr 28, 2019
Vacanze estive Aug 5, 2019 Aug 18, 2019

Exam calendar

Exam dates and rounds are managed by the relevant Science and Engineering Teaching and Student Services Unit.
To view all the exam sessions available, please use the Exam dashboard on ESSE3.
If you forgot your login details or have problems logging in, please contact the relevant IT HelpDesk, or check the login details recovery web page.

Exam calendar

Should you have any doubts or questions, please check the Enrollment FAQs

Academic staff

A B C D F G I M N O P R S V Z
AielliGian Piero

Aielli Gian Piero

Albi Giacomo

symbol email giacomo.albi@univr.it symbol phone-number +39 045 802 7913

Baldo Sisto

symbol email sisto.baldo@univr.it symbol phone-number 0458027935

Bos Leonard Peter

symbol email leonardpeter.bos@univr.it symbol phone-number +39 045 802 7987

Caliari Marco

symbol email marco.caliari@univr.it symbol phone-number +39 045 802 7904

Canevari Giacomo

symbol email giacomo.canevari@univr.it symbol phone-number +390458027979

Capuani Rossana

symbol email rossana.capuani@univr.it

Chignola Roberto

symbol email roberto.chignola@univr.it symbol phone-number 045 802 7953

Cozza Vittoria

symbol email vittoria.cozza@univr.it

Cubico Serena

symbol email serena.cubico@univr.it symbol phone-number 045 802 8132

Daffara Claudia

symbol email claudia.daffara@univr.it symbol phone-number +39 045 802 7942

Dai Pra Paolo

symbol email paolo.daipra@univr.it symbol phone-number +39 0458027093

Daldosso Nicola

symbol email nicola.daldosso@univr.it symbol phone-number +39 045 8027076 - 7828 (laboratorio)

Delledonne Massimo

symbol email massimo.delledonne@univr.it symbol phone-number 045 802 7962; Lab: 045 802 7058

De Sinopoli Francesco

symbol email francesco.desinopoli@univr.it symbol phone-number 045 842 5450

Di Persio Luca

symbol email luca.dipersio@univr.it symbol phone-number +39 045 802 7968

Favretto Giuseppe

symbol email giuseppe.favretto@univr.it symbol phone-number +39 045 802 8749 - 8748

Fioroni Tamara

symbol email tamara.fioroni@univr.it

Gnoatto Alessandro

symbol email alessandro.gnoatto@univr.it symbol phone-number 045 802 8537

Gonzato Guido

symbol email guido.gonzato@univr.it symbol phone-number 045 802 8303

Gregorio Enrico

symbol email Enrico.Gregorio@univr.it symbol phone-number 045 802 7937
ImperioMichele

Imperio Michele

Mantese Francesca

symbol email francesca.mantese@univr.it symbol phone-number +39 0458027978

Marigonda Antonio

symbol email antonio.marigonda@univr.it symbol phone-number +39 045 802 7809

Mattiolo Davide

symbol email davide.mattiolo@univr.it
Foto,  October 5, 2015

Mazzuoccolo Giuseppe

symbol email giuseppe.mazzuoccolo@univr.it symbol phone-number +39 0458027838

Monti Francesca

symbol email francesca.monti@univr.it symbol phone-number 045 802 7910

Nardon Chiara

symbol email chiara.nardon@univr.it

Orlandi Giandomenico

symbol email giandomenico.orlandi at univr.it symbol phone-number 045 802 7986

Patacca Marco

symbol email marco.patacca@univr.it symbol phone-number 0458028788

Rizzi Romeo

symbol email romeo.rizzi@univr.it symbol phone-number +39 045 8027088

Sala Pietro

symbol email pietro.sala@univr.it symbol phone-number 0458027850

Sansonetto Nicola

symbol email nicola.sansonetto@univr.it symbol phone-number 045-8027976

Schuster Peter Michael

symbol email peter.schuster@univr.it symbol phone-number +39 045 802 7029

Segala Roberto

symbol email roberto.segala@univr.it symbol phone-number 045 802 7997

Solitro Ugo

symbol email ugo.solitro@univr.it symbol phone-number +39 045 802 7977

Vincenzi Elia

symbol email elia.vincenzi@univr.it

Zuccher Simone

symbol email simone.zuccher@univr.it

Study Plan

The Study Plan includes all modules, teaching and learning activities that each student will need to undertake during their time at the University.
Please select your Study Plan based on your enrollment year.

CURRICULUM TIPO:

2° Year   activated in the A.Y. 2019/2020

ModulesCreditsTAFSSD
6
A
MAT/02
6
B
MAT/03
6
C
SECS-P/01
6
C
SECS-P/01
6
B
MAT/06
English B1
6
E
-

3° Year   activated in the A.Y. 2020/2021

ModulesCreditsTAFSSD
6
C
SECS-P/05
Final exam
6
E
-
activated in the A.Y. 2019/2020
ModulesCreditsTAFSSD
6
A
MAT/02
6
B
MAT/03
6
C
SECS-P/01
6
C
SECS-P/01
6
B
MAT/06
English B1
6
E
-
activated in the A.Y. 2020/2021
ModulesCreditsTAFSSD
6
C
SECS-P/05
Final exam
6
E
-
Modules Credits TAF SSD
Between the years: 1°- 2°- 3°
Between the years: 1°- 2°- 3°
Other activities
6
F
-

Legend | Type of training activity (TTA)

TAF (Type of Educational Activity) All courses and activities are classified into different types of educational activities, indicated by a letter.




S Placements in companies, public or private institutions and professional associations

Teaching code

4S00001

Teacher

Romeo Rizzi

Coordinator

Romeo Rizzi

Credits

6

Language

Italian

Scientific Disciplinary Sector (SSD)

MAT/09 - OPERATIONS RESEARCH

Period

II semestre dal Mar 1, 2021 al Jun 11, 2021.

Learning outcomes

The student will encounter in concrete the concepts of: problems, models, formulations of operations research, but also of instances, algorithms, reductions and mappings among problems of the computer science field. The course will propose some models of operations research, at least the following: linear programming (LP), integer linear programming (ILP), max-flows and min-cuts, bipartite matchings and node covers, minimum spanning trees, shortest paths, Eulerian paths, and some models resorting on dynamic programming among which some knapsack variants. For all these models/problems, except PLI, the student will learn the solving algorithms, the properties on which they hinge, and how to conduct their execution.
However, besides and beyond this, the course aims at building a good and active relationship, practice, and acquaintance, with general mathematical methodologies and techniques (more typical of discrete math and for this reason not yet fully assimilated from our students) and some basic underpinnings of computer science.
In particular, we insist on the dialog with problems and with the art/technique of conjecturing, no occasion is lost to spotlight where invariants and monovariants play a role in proofs, algorithms and data structures. We build up confidence with mathematical induction as an active tool for problem solving, and introducing the dialects of induction most voted to efficiency (divide et impera, recursion with memoization, dynamic programming).
Some basic principles of informatics are underlined, like coding, algorithms, data structures, recursion as a counterpart of mathematical induction and of computability. (In some editions of the course first scratch introductions to numerability and computability have been offered). Coming to efficiency, our central perspective, the use of asymptotic notation is justified and adopted, the classes P, NP, coNP are introduced, and the concepts of good characterizations, good conjectures and good theorems are illustrated in length and complexity theory is advertised as a lively source of new methodologies in the art of facing problems and enquiry their intrinsic structural properties. Several aspects of the role and importance of the art of reducing one problem to another are discussed and clarified. The life cycle of a good conjecture, the workflow linking good conjectures and algorithms, the production and interpretation of counterexamples as a means of dialog with the problem, and the possible use of them in obtaining NP-completeness proofs, are all discussed, investigated and exemplified in action. Explicit emphasis is constantly given to the role and use of certificates.
Meanwhile these transversal and high competences of methodological interest and imprinting are delivered, the students is asked to learn and develop several concrete procedural competences, in particular within LP, and in an algorithmic treatment of graph theory, introduced as a versatile model and an intuitive and expressive language for the formulation of problems.
For a complete and detailed list of all these procedural competences delivered and requested, see the past exams and corrections over the various editions of the course.
The notions from computational complexity introduced in the course, and the attention to the languages of the certificates, will lead the student to recognize with more awareness the structure of a sound proof.
Dealing with instances, problems, models, both from the perspective of algorithms and of models and formulations, will enforce the attitude and competence in casting simple problems from the applications into mathematical models. The knowledge of the paradigmatic results of linear programming theory (duality, complementary slackness, economic interpretation, sensitivity analysis) will provide the student with important tools in obtaining non-trivial insights on the practical problem from the model.

Program

Operations Research offers quantitative methods and models for the optimal management of resources, and optimization of profits, services, strategies, procedures.
This course of Operations Research gets to Mathematical Programming moving from Algorithmics and Computational Complexity.
After revisiting mathematical induction, recursion, divide et impera, with a curiosity driven problem solving approach, we insist on dynamic programming thinking which gets then exemplified in a few classical models of Operations Research and Computational Biology.
With emphasis on method and techniques, we get involved in formulating, encoding and modeling problems, conjecturing about them, reducing one to the other,
and well characterizing them.
The course offers an in-depth introduction to linear programming.
Following the historical path, we introduce graphs as for modeling,
and explore the basic fundamental results in combinatorial optimization and graph theory.

LIST OF TOPICS:

1. Basic Notions
problems
models
algorithms
complexity

2. Introduction to Algorithms and Complexity
analysis of a few algorithms
design techniques (recursion, divide et impera, recursion with memoization, dynamic programming, greedy)
complexity theory (P, NP, co-NP, good characterizations, good conjectures, examples of NP-completeness proofs)

3. Combinatorial Optimization Models
knapsack problems
Problems on sequences
Problems on DAGs

4. Introduction to Graph Theory
graphs and digraphs as models
a few good characterizations (bipartite, Eulerian, acyclic, planar graphs)
a few NP-hard models (Hamiltonian cycles, cliques, colorability)
shortest paths
minimum spanning trees
maximum flows
bipartite matchings

5. Linear Programming (LP)
the LP and the ILP models (definition, motivations, complexity, role)
geometric method and view (feasibility space,
pivot, duality, dual variables, degeneracy, complementary slackness)
standard and canonical form
simplex method
duality theory
complementary slackness
economic interpretation of the dual variables
sensitivity analysis

BOOKS, NOTES AND OTHER DIDACTIC MATERIALS AND RESOURCES:

At the following page you find a list of available materials (books, notes, videos) about topics covered within the course:

http://profs.sci.univr.it/~rrizzi/classes/RO/materiali

If you find out further effective material help us enlarging this list.

TUTORING (IF AVAILABLE):

For the 2020-21 edition we are planning to introduce a tutor that will assist and guide the students in performing the exercises suggested during the class and in conducting practical experiences.

Reference texts
Author Title Publishing house Year ISBN Notes
Garey, M. R. and Johnson, D. S. Computers intractability: a guide to the theory of NP-completeness Freeman 1979 0-7167-1045-5
T. Cormen, C. Leiserson, R. Rivest, C. Stein Introduzione agli Algoritmi e Strutture Dati (Edizione 2) McGraw-Hill 2005 88-386-6251-7
Robert J. Vanderbei Linear Programming: Foundations and Extensions (Edizione 4) Springer 2001 978-1-4614-7630-6

Examination Methods

At the end of the course, a written exam with various types of exercises and questions, and several opportunities to gather points to test and prove your preparation. You can add (in full or in part) to the mark acquired at the exam by conducting projects aiming at improving aspects and/or materials of the course in a broad sense.

Up to and included the 2018/19 edition, the exam was taking place in a room by our department in Ca' Vignal.
In the 2019/20 edition (onset of COVID-19) the exams took place from remote, followed by an oral discussion meant only as a check and also as an opportunity for direct confrontation and exchange.
Since many details concerning the exams are subject to dynamic evolution and also determined in the exchanges of ideas and proposals inside the class, and we want to make sure no student gets lost, we redirect the student directly to the reference service site that we can maintain constantly updated:

http://profs.sci.univr.it/~rrizzi/classes/RO/index.html

We warmly advise every student to subscribe to the Telegram group for the current edition of the course and for the testing of the installations, configurations, and environments set up for the exam. All these resources can be conveniently accessed from the URL here above.

We underline a peculiarity of the Operations Research course, the only one in discrete mathematics at the bachelor: the approach and spirit with which you should approach the course and the exam, and what to deliver and elaborate in your answers to the exercises, is actually related to some deep methodological messages that we decided to place at the core of the course. The more the student adopts and interprets these approaches, the more he/she will be proactive in the course and in collaborating to any verification, the more enriching the course and the more fun the exam will be. This will be important in getting the most from the course and achieve full satisfaction and recognition at the exam.

There are 4 exam sessions each academic year (June, July, September, February). The exam is the very same regardless on whether you have attended or not the course. The archives of the past exams, the relative corrections, and the videos of the classes, all can help overcoming the difficulties of the non-attending student.

Students with disabilities or specific learning disorders (SLD), who intend to request the adaptation of the exam, must follow the instructions given HERE

Type D and Type F activities

Modules not yet included

Career prospects


Module/Programme news

News for students

There you will find information, resources and services useful during your time at the University (Student’s exam record, your study plan on ESSE3, Distance Learning courses, university email account, office forms, administrative procedures, etc.). You can log into MyUnivr with your GIA login details: only in this way will you be able to receive notification of all the notices from your teachers and your secretariat via email and soon also via the Univr app.

Graduation

For schedules, administrative requirements and notices on graduation sessions, please refer to the Graduation Sessions - Science and Engineering service.

Documents

Title Info File
File pdf 1. Come scrivere una tesi pdf, it, 31 KB, 29/07/21
File pdf 2. How to write a thesis pdf, it, 31 KB, 29/07/21
File pdf 5. Regolamento tesi pdf, it, 171 KB, 20/03/24

List of theses and work experience proposals

theses proposals Research area
Formule di rappresentazione per gradienti generalizzati Mathematics - Analysis
Formule di rappresentazione per gradienti generalizzati Mathematics - Mathematics
Proposte Tesi A. Gnoatto Various topics
Mathematics Bachelor and Master thesis titles Various topics
THESIS_1: Sensors and Actuators for Applications in Micro-Robotics and Robotic Surgery Various topics
THESIS_2: Force Feedback and Haptics in the Da Vinci Robot: study, analysis, and future perspectives Various topics
THESIS_3: Cable-Driven Systems in the Da Vinci Robotic Tools: study, analysis and optimization Various topics
Stage Research area
Internship proposals for students in mathematics Various topics

Attendance

As stated in the Teaching Regulations for the A.Y. 2022/2023, except for specific practical or lab activities, attendance is not mandatory. Regarding these activities, please see the web page of each module for information on the number of hours that must be attended on-site.
 


Career management


Student login and resources


Erasmus+ and other experiences abroad


Commissione tutor

La commissione ha il compito di guidare le studentesse e gli studenti durante l'intero percorso di studi, di orientarli nella scelta dei percorsi formativi, di renderli attivamente partecipi del processo formativo e di contribuire al superamento di eventuali difficoltà individuali.

E' composta dai proff. Sisto Baldo, Marco Caliari, Francesca Mantese, Giandomenico Orlandi e Nicola Sansonetto