11 citations · 11 across the 3 of their papers we have counts for
3 papers
math.OC2025
On Solving the Knapsack Problem with Conflicts
Roberto Montemanni, Derek H. Smith
A variant of the well-known Knapsack Problem is studied in this paper, where pairs of items are conflicting, and cannot be selected at the same time. This configures a set of hard…
math.OC2025
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts
Roberto Montemanni, Derek H. Smith
A variant of the well-known Shortest Path Problem is studied in this paper, where pairs of conflicting arcs are provided, and for each conflicting pair a penalty is paid once neith…
math.OC2023★ 11 cited
An Ant Colony System for the Team Orienteering Problem with Time Windows
Roberto Montemanni, Luca Maria Gambardella
This paper discusses a heuristic approach for Team Orienteering Problems with Time Windows. The method we propose takes advantage of a solution model based on a hierarchic generali…