## 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.

## Course calendar

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

Period | From | To |
---|---|---|

I semestre | Oct 1, 2012 | Jan 31, 2013 |

II semestre | Mar 4, 2013 | Jun 14, 2013 |

Session | From | To |
---|---|---|

Sessione straordinaria | Feb 4, 2013 | Feb 28, 2013 |

Sessione estiva | Jun 17, 2013 | Jul 31, 2013 |

Sessione autunnale | Sep 2, 2013 | Sep 30, 2013 |

Session | From | To |
---|---|---|

Sessione autunnale | Oct 16, 2012 | Oct 16, 2012 |

Sessione straordinaria | Dec 10, 2012 | Dec 10, 2012 |

Sessione invernale | Mar 19, 2013 | Mar 19, 2013 |

Sessione estiva | Jul 22, 2013 | Jul 22, 2013 |

Period | From | To |
---|---|---|

Festa di Ognissanti | Nov 1, 2012 | Nov 1, 2012 |

Festa dell'Immacolata Concezione | Dec 8, 2012 | Dec 8, 2012 |

Vacanze di Natale | Dec 21, 2012 | Jan 6, 2013 |

Vacanze di Pasqua | Mar 29, 2013 | Apr 2, 2013 |

Festa della Liberazione | Apr 25, 2013 | Apr 25, 2013 |

Festa del Lavoro | May 1, 2013 | May 1, 2013 |

Festa del Santo Patrono di Verona - San Zeno | May 21, 2013 | May 21, 2013 |

Festa della Repubblica | Jun 2, 2013 | Jun 2, 2013 |

Vacanze estive | Aug 9, 2013 | Aug 16, 2013 |

## 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.

## Academic staff

Residori Stefania

stefania.residori@univr.itSquassina Marco

marco.squassina@univr.it +39 045 802 7913## 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 enrolment year.

Modules | Credits | TAF | SSD |
---|

Modules | Credits | TAF | SSD |
---|

Modules | Credits | TAF | SSD |
---|

1° Year

Modules | Credits | TAF | SSD |
---|

2° Year activated in the A.Y. 2013/2014

Modules | Credits | TAF | SSD |
---|

3° Year activated in the A.Y. 2014/2015

Modules | Credits | TAF | SSD |
---|

Modules | Credits | TAF | SSD |
---|

#### 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.

### Operations Research (2014/2015)

Teaching code

4S00001

Teacher

Coordinatore

Credits

6

Language

Italian

Scientific Disciplinary Sector (SSD)

SECS-S/06 - MATHEMATICAL METHODS OF ECONOMICS, FINANCE AND ACTUARIAL SCIENCES

Period

II sem. dal Mar 2, 2015 al Jun 12, 2015.

## Learning outcomes

This course aims to introduce the student to some basic models and to the main methodologies in the optimization field, with a particular attention to dynamic programming, combinatorial optimization, graphs, linear programming. Complexity theory is introduced and used as a tool and the role of integer linear programming within the OR community is illustrated.

## Program

Basic notions: models and algorithms, computational complexity, recursion and induction, invariants and monovariants, graphs, convex sets, polyhedra and cones.

Some of the models in Dynamic Programming: maximum increasing subsequence, maximum common subsequence, knapsack models.

Some of the models in graphs: Eulerian ed Hamiltonian paths and cycles, planar graphs and their duals, bipartite graphs, shortest paths, minimum spanning trees, max flow/min cut, maximum matching.

Linear programming: mathematical formulation of linear programming problems; equivalent forms, standard form; mathematical structure, geometry of linear programming, properties.

The simplex algorithm: vertices and basic solutions; optimality conditions; tableau method, auxiliary problem, two-phases method.

Duality theory: the fundamental duality theorem of linear programming, the dual simplex algorithm; economic interpretation; sensitivity analysis.

Integer linear programming: the cutting plane method; the branch and bound.

Network optimization: the minimum spanning tree problem, the shortest path problem, the maximum flow problem.

A more detailed program as intended, the day-by-day program of the last edition of the course, and the ongoing program of the current edition are available at the web-page of the course:

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

## Examination Methods

Written final examination.

Past exams with answers can be found at the web-page of the course:

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

**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

## Attachments

Title | Info File |
---|---|

1. Come scrivere una tesi | 31 KB, 29/07/21 |

2. How to write a thesis | 31 KB, 29/07/21 |

5. Regolamento tesi (valido da luglio 2022) | 171 KB, 17/02/22 |

## 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.

Please refer to the Crisis Unit's latest updates for the mode of teaching.