Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 20 for “"MAT/09 Ricerca operativa"”.
-
Enhanced Mixed Integer Programming Techniques and Routing Problems
… 50 and more years of intensive research has dramatically improved on the capability of the current generation of MIP solvers to tackle hard problems in practice. However, many questions are still open and not fully understood, and the mixed integer programming community is still more than active …
-
Application-oriented Mixed Integer Non-Linear Programming
In the most recent years there is a renovate interest for Mixed Integer Non-Linear Programming (MINLP) problems. This can be explained for different reasons: (i) the performance of solvers handling non-linear constraints was largely improved; (ii) the awareness that most of the applications from …
-
Combinatorial and Robust Optimisation Models and Algorithms for Railway Applications
… One of the main issues concerns imperfect information. The idea of Robust Optimisation, as a way to represent and handle mathematically systems with not precisely known data, dates back to 1970s. Unfortunately, none of those techniques proved to be successfully applicable in one of the most …
-
Unilateral Commitments
The research done in the thesis in within the non-cooperative games on the following three topics: 1) Binary symmetric games. 2) Quality unilateral commitments. 3) Essentializing equilibrium concepts.
-
The algebraic representation of OWA functions in the binomial decomposition framework and its applications in large-scale problems
In the context of multicriteria decision making, the ordered weighted averaging (OWA) functions play a crucial role in aggregating multiple criteria evaluations into an overall assessment to support decision makers reaching a decision. The determination of OWA weights is, therefore, an important …
-
MCDM methods based on pairwise comparison matrices and their fuzzy extension
Methods based on pairwise comparison matrices (PCMs) form a significant part of multi-criteria decision making (MCDM) methods. These methods are based on structuring pairwise comparisons (PCs) of objects from a finite set of objects into a PCM and deriving priorities of objects that represent the …
-
Single Machine Rescheduling for New Orders
L'abstract è presente nell'allegato / the abstract is in the attachment
-
New models and algorithms for the timetables of Italian high schools
The thesis investigates new timetabling problems, which are motivated by the com- plex case of Italian schools. Generally speaking, the High School Timetabling Problem is aimed at giving the right order to the meetings between groups of students and teachers. However, it requires to pre-assign …
-
A Reactive Search Optimization approach to interactive decision making
… evolves in response to the additional information provided by the user. We believe that understanding the interplay between these two learning processes is essential to improve the design of interactive decision making systems. This thesis goes in this direction, 1) by considering a final …
-
Complexity in Infinite Games on Graphs and Temporal Constraint Networks
… number of algorithmic problems motivated by automated temporal planning and formal verification of reactive and finite state systems. Particularly, we shall focus on game theoretical methods in order to obtain improved complexity bounds and faster algorithms for the following models: Hyper …
-
An integrated use of tools to acquire knowledge elements and support decisions in innovations processes
… “How could be facilitated decision in such problematic situations?”. Acquiring and organizing knowledge and information elements can be essential not only to understand but also to eliminate, reduce or control complexity and uncertainty. “Traditional quantitative methods, mathematical (functional) …
-
Last-mile logistics optimization in the on-demand economy
L'abstract è presente nell'allegato / the abstract is in the attachment
-
MATHEMATICAL PROGRAMMING ALGORITHMS FOR NETWORK OPTIMIZATION PROBLEMS
In the thesis we consider combinatorial optimization problems that are defined by means of networks. These problems arise when we need to take effective decisions to build or manage network structures, both satisfying the design constraints and minimizing the costs. In the thesis we focus our …
-
Dynamic optimization under uncertainty: Applications in engineering, manufacturing, and retail.
L'abstract è presente nell'allegato / the abstract is in the attachment
-
Assessing solar radiation components over the alpine region Advanced modeling techniques for environmental and technological applications.
This thesis examines various methods for estimating the spatial distribution of solar radiation, and in particular its diffuse and direct components in mountainous regions. The study area is the Province of Bolzano (Italy). The motivation behind this work is that radiation components are an …