As opposed to traditional supervised learning, multiple-instance learning concerns the problem of classifying a bag of instances, given bags that are labeled by a teacher as being...
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
Mauritsius Tuga, Regina Berretta, Alexandre Mendes
Research in the field of examination timetabling has developed in two directions. The first looks at applying various methodologies to induce examination timetables. The second tak...
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...