Learn More
We present the progress on the benchmarking project for high school timetabling that was introduced at PATAT 2008. In particular, we announce the High School Timetabling Archive XHSTT-2011 with 21 instances from 8 countries and an evaluator capable of checking the syntax of instances and evaluating the solutions.
One hundred eighty male managers participated as age-homogeneous 4-person teams in a validated all-day decision-making simulation. Fifteen teams consisted of 28- to 35-year-old participants (young), 15 teams were in the 45-55 age range (middle-aged), and 15 teams consisted of 65- to 75-year-old (older) persons. More than 40 objective performance measures(More)
This note is devoted to a more detailed description of one of the five simple exceptional Lie superalgebras of vector fields, cvect(0|3) * , a subalgebra of vect(4|3). We derive differential equations for its elements , and solve these equations. Hence we get an exact form for the elements of cvect(0|3) *. Moreover we realize cvect(0|3) * by " glued " pairs(More)
In this paper we propose a neighbourhood structure based on sequential/cyclic moves and a Cyclic Transfer algorithm for the high school timetabling problem. This method enables execution of complex moves for improving an existing solution, while dealing with the challenge of exploring the neighbourhood efficiently. An improvement graph is used in which(More)
We study finite-dimensional Lie algebras of polynomial vector fields in n variables that contain the vector fields ∂ ∂x i x 1 ∂ ∂x 1 + · · · + x n ∂ ∂x n. We derive some general results on the structure of such Lie algebras, and provide the complete classification in the cases n = 2 and n = 3. Finally we describe a certain construction in high dimensions.(More)
We study finite-dimensional Lie algebras L of polynomial vector fields in n variables that contain the vector fields ∂ ∂x i and x 1 ∂ ∂x 1 + · · · + x n ∂ ∂x n. We show that the maximal ones always contain a semi-simple subalgebra ¯ g, such that ∂ ∂x i ∈ ¯ g (i = 1,. .. , m) for an m with 1 ≤ m ≤ n. Moreover a maximal algebra has no trivial ¯ g-module in(More)
We study round-robin tournaments for n teams, where in each round a fixed number (g) of teams is present and each team present plays a fixed number (m) of matches in this round. In the tournament each match between two teams is either played once or twice, in the latter case in different rounds. We give necessary combina-torial conditions on the triples (n,(More)