281 research outputs found
Natura delle cose è ciò come esse effettivamente nascono: Emilio Betti e il problema della storia in Vico (I)
No full textRilievo del pensiero vichiano nella teoria dell'interpretazione di Emilio Betti. Influenza di Vico sulla concezione della storia in Betti. La Napoli di Vico e le sue istituzioni.Relief of Vico's thought in Emilio Betti's theory of interpretation. Vico's influence on Betti's conception of history. Vico's Naples and its institutions
A Memetic Algorithm for the Weighted Feedback Vertex Set Problem
No full textGiven an undirected and vertex weighted graph G = (V,E,w), the Weighted Feedback Vertex Set Problem consists of finding the subset F ⊆ V of vertices, with minimum weight, whose removal results in an acyclic graph. Finding the minimum feedback vertex set in a graph is an important combinato- rial problem that has a variety of real applications. In this paper we introduce a memetic algorithm for this problem. We propose an efficient greedy procedure that quickly generates chromosomes with specific characteristics and a wise application of a recent local search procedures based on k-diamonds. Computa- tional results show that the proposed algorithm outperforms the effectiveness of two other metaheuristics recently proposed in the literature for this problem
A Tabu Search Approach for the Circle Packing Problem
No full textThis paper concerns the problem to place N non overlapping circles in a circular container with minimum radius. This is a well known and widely studied problem with applications in manufacturing and logistics and, in particular, to problems related to cutting and packing. In this paper we propose an algorithm that by applying a strength along a selected direction on each circle, simulates the shifting of circles on the plane and tries to reduce the radius of the circular container during this movements. The algorithm is based on a multistart technique where the starting solutions are produced by a tabu search heuristic that uses also the current best solution. The algorithm takes part in a public international contest in order to find optimal solutions to a special case in circle packing. The contest saw the participation of 155 teams and our algorithm achieved the tenth positio
Appunti intorno ad interpretazione e principi (con particolare riferimento alle fonti del diritto) nel pensiero di Alessandro Giuliani
No full textA multiethnic genetic approach for the minimum conflict weighted spanning tree problem
No full textThis paper addresses a variant of the minimum spanning tree problem in which, given a list of conflicting edges, the primary goal is to find a spanning tree with the minimum number of conflicting edge pairs and the secondary goal is to minimize the weight of spanning trees without conflicts. The problem is NP-hard and it finds applications in the design of offshore wind farm networks. We propose a multiethnic genetic algorithm for the problem in which the fitness function is designed to simultaneously manage the two goals of the problem. Moreover, we introduce three local search procedures to improve the solutions inside the population during the computation. Computational results performed on benchmark instances reveal that our algorithm outperforms the other heuristic approach, proposed in the literature, for this problem
NEW DEVELOPMENTS AND INSIGHTS ABOUT CORPORATE GOVERNANCE AND RISK GOVERNANCE IN ITALIAN BANKS
No full textA novel discretization scheme for the close enough traveling salesman problem
No full textThis paper addresses a variant of the Euclidean traveling salesman problem in which the traveler visits a node if it passes through the neighborhood set of that node. The problem is known as the close-enough traveling salesman problem. We introduce a new effective discretization scheme that allows us to compute both a lower and an upper bound for the optimal solution. Moreover, we apply a graph reduction algorithm that significantly reduces the problem size and speeds up computation of the bounds. We evaluate the effectiveness and the performance of our approach on several benchmark instances. The computational results show that our algorithm is faster than the other algorithms available in the literature and that the bounds it provides are almost always more accurate
- …
