41 citations · 57 across the 6 of their papers we have counts for
3 papers · 1 filter
Solving the Probabilistic Profitable Tour Problem on a Tree
Enrico Angelelli, Renata Mansini, Romeo Rizzi
The profitable tour problem (PTP) is a well-known NP-hard routing problem searching for a tour visiting a subset of customers while maximizing profit as the difference between tota…
A heuristic algorithm for the Air Transport Unit Consolidation Problem
Enrico Angelelli, Claudia Archetti, Lorenzo Peirano
Consolidation of loose packages into transport units is a fundamental activity offered by logistics service-providers. Moving the transport units instead of loose packages is faste…
The Probabilistic Profitable Tour Problem under a specific graph structure
Enrico Angelelli, Renata Mansini, Romeo Rizzi
Among the most important variants of the traveling salesman problem (TSP) are those relaxing the constraint that every locus should necessarily get visited, rather taking into acco…