1 citations · 1 across the 1 of their papers we have counts for
1 paper
Miroslaw Blocho, Jakub Nalepa
This paper presents the pessimistic time complexity analysis of the parallel algorithm for minimizing the fleet size in the pickup and delivery problem with time windows. We show h…