We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Tail Assignment is the problem of assigning flight legs to aircraft while satisfying all operational constraints, and optimizing some objective function. In this article, we presen...
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of sol...