|
|
|
|
|
Mauro Dell?Amico, Jafar Jamal and Roberto Montemanni
The minimum-cost arborescence problem is a well-studied problem. Polynomial-time algorithms for solving it exist. Recently, a new variation of the problem called the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times was presente...
ver más
|
|
|
|
|
|
|
|
|
|
|
Roberto Montemanni and Mauro Dell?Amico
Drones are currently seen as a viable way of improving the distribution of parcels in urban and rural environments, while working in coordination with traditional vehicles, such as trucks. In this paper, we consider the parallel drone scheduling travelin...
ver más
|
|
|
|
|
|
|
|
|
|
|
Giulia Pugliese, Xiaochen Chou, Dominic Loske, Matthias Klumpp and Roberto Montemanni
Manual order picking, the process of retrieving stock keeping units from their storage location to fulfil customer orders, is one of the most labour-intensive and costly activity in modern supply chains. To improve the outcome of order picking systems, a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Umberto Junior Mele, Luca Maria Gambardella and Roberto Montemanni
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 t...
ver más
|
|
|
|
|
|
|
|
|
|
|
Nicola Ognibene Pietri, Xiaochen Chou, Dominic Loske, Matthias Klumpp and Roberto Montemanni
Online shopping is growing fast due to the increasingly widespread use of digital services. During the COVID-19 pandemic, the desire for contactless shopping has further changed consumer behavior and accelerated the acceptance of online grocery purchases...
ver más
|
|
|
|
|
|
|
|
|
|
|
Derek H. Smith, Roberto Montemanni and Stephanie Perkins
Let ??=(??,??)
G
=
(
V
,
E
)
be an undirected graph with vertex set V and edge set E. A clique C of G is a subset of the vertices of V with every pair of vertices of C adjacent. A maximum clique is a clique with the maximum number of vertices. A tabu se...
ver más
|
|
|
|
|
|
|
|
|
|
|
Montemanni, R. Moon, J. N. J. Smith, D. H.
Pág. 891 - 901
|
|
|
|
|
|
|
|
|
|
|
Montemanni, R. Smith, D. H. Allen, S. M.
Pág. 949 - 953
|
|
|
|
|
|