No description available.

No description available.

Combinatorial Optimization is a branch of optimization that deals with the problems where the set of feasible solutions is discrete. Routing problem is a well studied branch of Combinatorial Optimization that concerns the process of deciding the best way of visiting the nodes (customers) in a network. Routing problems appear in many real world applications including: Transportation, Telephone or Electronic data Networks. During the years, many solution procedures have been introduced for the solution of different Routing problems. Some of them are based on exact approaches to solve the problems to optimality and some others are based on heuristic or metaheuristic search to find optimal or near optimal solutions. There is also a less studied method, which combines both heuristic and exact approaches to face different problems including those in the Combinatorial Optimization area. The aim of this dissertation is to develop some solution procedures based on the combination of heuristic and Integer Linear Programming (ILP) techniques for some important problems in Routing Optimization. In this approach, given an initial feasible solution to be possibly improved, the method follows a destruct-and-repair paradigm, where the given solution is randomly destroyed (i.e., customers are removed in a random way) and repaired by solving an ILP model, in an attempt to find a new improved solution.

Crew scheduling and crew rostering are similar and related problems which can be solved by similar procedures. So far, the existing solution methods usually create a model for each one of these problems (scheduling and rostering), and when they are solved together in some cases an interaction between models is considered in order to obtain a better solution. A single set covering model to solve simultaneously both problems is presented here, where the total quantity of drivers needed is directly considered and optimized. This integration allows to optimize all of the depots at the same time, while traditional approaches needed to work depot by depot, and also it allows to see and manage the relationship between scheduling and rostering, which was known in some degree but usually not easy to quantify as this model permits. Recent research in the area of crew scheduling and rostering has stated that one of the current challenges to be achieved is to determine a schedule where crew fatigue, which depends mainly on the quality of the rosters created, is reduced. In this approach rosters are constructed in such way that stable working hours are used in every week of work, and a change to a different shift is done only using free days in between to make easier the adaptation to the new working hours. Computational results for real-world-based instances are presented. Instances are geographically diverse to test the performance of the procedures and the model in different scenarios.

No description available.

In the present study we analyzed new neuroprotective therapeutical strategies in PD (Parkinson’s disease) and AD (Alzheimer’s disease). Current therapeutic strategies for treating PD and AD offer mainly transient symptomatic relief but it is still impossible to block the loss of neuron and then the progression of PD and AD. There is considerable consensus that the increased production and/or aggregation of α- synuclein (α-syn) and β-amyloid peptide (Aβ), plays a central role in the pathogenesis of PD, related synucleinopathies and AD. Therefore, we identified antiamyloidogenic compounds and we tested their effect as neuroprotective drug-like molecules against α-syn and β-amyloid cytotoxicity in PC12. Herein, we show that two nitro-catechol compounds (entacapone and tolcapone) and 5 cathecol-containing compounds (dopamine, pyrogallol, gallic acid, caffeic acid and quercetin) with antioxidant and anti-inflammatory properties, are potent inhibitors of α-syn and β-amyloid oligomerization and fibrillization. Subsequently, we show that the inhibition of α-syn and β-amyloid oligomerization and fibrillization is correlated with the neuroprotection of these compounds against the α-syn and β-amyloid-induced cytotoxicity in PC12. Finally, we focused on the study of the neuroprotective role of microglia and on the possibility that the neuroprotection properties of these cells could be use as therapeutical strategy in PD and AD. Here, we have used an in vitro model to demonstrate neuroprotection of a 48 h-microglial conditioned medium (MCM) towards cerebellar granule neurons (CGNs) challenged with the neurotoxin 6-hydroxydopamine (6-OHDA), which induces a Parkinson-like neurodegeneration, with Aβ42, which induces a Alzheimer-like neurodegeneration, and glutamate, involved in the major neurodegenerative diseases. We show that MCM nearly completely protects CGNs from 6-OHDA neurotoxicity, partially from glutamate excitotoxicity but not from Aβ42 toxin.

In this thesis we present some combinatorial optimization problems, suggest models and algorithms for their effective solution. For each problem,we give its description, followed by a short literature review, provide methods to solve it and, finally, present computational results and comparisons with previous works to show the effectiveness of the proposed approaches. The considered problems are: the Generalized Traveling Salesman Problem (GTSP), the Bin Packing Problem with Conflicts(BPPC) and the Fair Layout Problem (FLOP).

Lo scopo dello studio è quello di valutare il comportamento all’ecografia B mode e con mezzo di contrasto delle metastasi epatiche da tumore neuroendocrino ed individuare eventuali peculiarità in base alla sede del tumore primitivo, al tipo istologico, al grado di differenziazione, al Ki 67 ed al tipo di marcatore bioumorale.

No description available.

No description available.