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.
Study Plan
This information is intended exclusively for students already enrolled in this course.If you are a new student interested in enrolling, you can find information about the course of study on the course page:
Laurea magistrale in Mathematics - Enrollment from 2025/2026The 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.
1° Year
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
3 course to be chosen among the following
One course to be chosen among the following
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.
Research and modelling seminar (seminar course) (2016/2017)
Teaching code
4S003730
Teacher
Coordinator
Credits
6
Language
English
Scientific Disciplinary Sector (SSD)
MAT/07 - MATHEMATICAL PHYSICS
Period
I sem. dal Oct 3, 2016 al Jan 31, 2017.
Learning outcomes
In this seminar course there will be presented some mathematical aspects of the modelization of complex real-world systems.
Program
Mathematical tools for modeling: elements of optimization.
First part: "The Multi-Vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints and Unitary Demands: A Branch-and-Price Approach" by prof. Renata Mansini (University of Brescia)
In this work, we study a supplier selection and routing problem where a fleet of homogeneous vehicles with a predefined capacity is available for procuring different products from different suppliers with the aim to satisfy demand at the minimum traveling and purchasing cost. Decisions are further complicated by the presence of pairwise incompatibility constraints among products, implying the impossibility of loading two incompatible products on the same vehicle. The problem is known as the Multi-Vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints. We study the special case in which the demand for each product is unitary and propose a column generation approach based on a Dantzig-Wolfe reformulation of the problem, where each column represents a feasible vehicle route associated with a compatible purchasing plan.
To solve the pricing problem we propose an hybrid strategy exploiting the advantages of two alternative exact methods, a labeling algorithm solving a Resource-Constrained Elementary Shortest Path Problem on an expanded graph, and a tailored branch-and-cut algorithm.
Due to the integrality request on variables, we embed the column generation in a branch-and-bound framework and propose different branching rules.
Extensive tests, carried out on a large set of instances, show that our branch-and-price method performs well, improving on average, both in quality and in computational time, solutions obtained by a state-of-art branch-and-cut approach applied to a three-index connectivity constraints based formulation.
Author | Title | Publishing house | Year | ISBN | Notes |
---|---|---|---|---|---|
Ivar Ekeland and Roger Témam | Convex Analysis and Variational Problems | SIAM | 1987 | 0-89871-450-8 |
Examination Methods
This is a seminar course. Students will present a project on a topic decided by the teacher at the end of the course.