Roberto Aringhieri

Learn More
P2P applications are rapidly gaining acceptance among users of Internet-based services, especially because of their capability of exchanging resources while preserving the anonymity of both requestors and providers. However, concerns have been raised about the possibility that malicious users can exploit the network to spread tampered-with resources (e.g.,(More)
TheMaximum Diversity Problem (MDP) requires to extract a subsetM of given cardinality from a set N, maximising the sum of the pair-wise diversities between the extracted elements. The MDP has recently been the subject of much research, and several sophisticated heuristics have been proposed to solve it. The present work compares four local search(More)
District heating plants are becoming more common in European cities, especially in the northern countries. These systems make it possible to furnish users with warm water while locating the production plants in the outskirts. This has the double benefit of lowering the impact of pollution on the center of the city and achieving better conversion(More)
Description: The Maximum Diversity Problem consists in determining a subset M of given cardinality from a set N of elements, in such a way that the sum of the pairwise differences between the elements of M is maximum. This problem, introduced by Glover, Hersh andMcMillian, has been deeply studied using the GRASP methodology. GRASPs are often characterized(More)
Given a set N, a pairwise distance function d and an integer number m, the Dispersion Problems (DPs) require to extract from N a subset M of cardinality m, so as to optimize a suitable function of the distances between the elements in M. Different functions give rise to a whole family of combinatorial optimization problems. In particular, the max-sum DP and(More)