1 citations · 2 across the 4 of their papers we have counts for
4 papers
Block approximations for probabilistic mixtures of elementary cellular automata
E. N. M. Cirillo, G. Lancia, C. Spitoni
Probabilistic Cellular Automata are a generalization of Cellular Automata. Despite their simple definition, they exhibit fascinating and complex behaviours. The stationary behaviou…
Algorithmic strategies for finding the best TSP 2-OPT move in average sub-quadratic time
Giuseppe Lancia, Paolo Vidoni
We describe an exact algorithm for finding the best 2-OPT move which, experimentally, was observed to be much faster than the standard quadratic approach. To analyze its average-ca…
Orbits, schemes and dynamic programming procedures for the TSP 4-OPT neighborhood
Giuseppe Lancia, Marcello Dalpasso
We discuss the way to group all 25 possible 4-OPT moves into 7 orbits of equivalent moves. We then describe two implementations, one for a algorithm by de Berg's et al. an…
Proving hamiltonian properties in connected 4-regular graphs: an ILP-based approach
Giuseppe Lancia, Eleonora Pippia, Franca Rinaldi
In this paper we study some open questions related to the smallest order of a 4-regular graph which has a connectivity property but does not…