41 citations · 57 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
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…
cs.DS2014★ 41 cited
A reclaimer scheduling problem arising in coal stockyard management
Enrico Angelelli, Thomas Kalinowski, Reena Kapoor +1
We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of ea…