Abstract: The orienteering problem (OP) is a well-studied routing problem that has been extended to incorporate uncertainties, reflecting stochastic or dynamic travel costs, prize-collection costs, ...

Abstract: In this paper, we propose to solve the max-min multiple knapsack problem by using an exact solution search. An instance of the problem is defined by a set of n items to be packed into m ...