Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...
Peter Brucker, Edmund K. Burke, Timothy Curtois, R...