Perfeziona i miei risultati

A new constructive heuristic driven by machine learning for the traveling salesman problem

Mele, Umberto Junior ; Gambardella, Luca Maria ; Montemanni, Roberto

In: Algorithms, 2021, vol. 14, no. 9, p. 25

Recent systems applying Machine Learning (ML) to solve the Traveling Salesman Problem (TSP) exhibit issues when they try to scale up to real case scenarios with several hundred vertices. The use of Candidate Lists (CLs) has been brought up to cope with the issues. A CL is defined as a subset of all the edges linked to a given vertex such that it contains mainly edges that are believed to be...

Permutation codes with specified packing radius

Smith, Derek ; Montemanni, Roberto

In: Designs, Codes and Cryptography, 2013, vol. 69, no. 1, p. 95-106

Minimum power multicasting in wireless networks under probabilistic node failures

Barta, János ; Leggieri, Valeria ; Montemanni, Roberto ; Nobili, Paolo ; Triki, Chefi

In: Computational Optimization and Applications, 2011, vol. 49, no. 1, p. 193-212

The robust shortest path problem with interval data via Benders decomposition

Montemanni, Roberto ; Gambardella, Luca

In: 4OR, 2005, vol. 3, no. 4, p. 315-328

A new table of permutation codes

Smith, Derek ; Montemanni, Roberto

In: Designs, Codes and Cryptography, 2012, vol. 63, no. 2, p. 241-253

Wireless multicasting under probabilistic node failures: a heuristic approach

Barta, János ; Montemanni, Roberto

In: Optimization and Engineering, 2012, vol. 13, no. 4, p. 705-726