We consider four different models of process interactions that unify and generalise models introduced and studied by Angluin et al. [AAD+ 04] and models introduced and studied by ...
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
In this paper we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and...
Michelangelo Bucci, Aldo de Luca, Alessandro De Lu...
The Arc-Preserving Subsequence (APS) problem appears in the comparison of RNA structures in computational biology. Given two arcannotated sequences of length n and m < n, APS a...