21 citations · 55 across the 11 of their papers we have counts for
4 papers · 1 filter
A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem
Moritz Mühlenthaler, Rolf Wanka
We propose a decomposition of the max-min fair curriculum-based course timetabling (MMF-CB-CTT) problem. The decomposition models the room assignment subproblem as a generalized le…
Fairness in Academic Course Timetabling
Moritz Mühlenthaler, Rolf Wanka
We consider the problem of creating fair course timetables in the setting of a university. Our motivation is to improve the overall satisfaction of individuals concerned (students,…
Particles Prefer Walking Along the Axes: Experimental Insights into the Behavior of a Particle Swarm
Manuel Schmitt, Rolf Wanka
Particle swarm optimization (PSO) is a widely used nature-inspired meta-heuristic for solving continuous optimization problems. However, when running the PSO algorithm, one encount…
Exploiting Independent Subformulas: A Faster Approximation Scheme for #k-SAT
Manuel Schmitt, Rolf Wanka
We present an improvement on Thurley's recent randomized approximation scheme for #k-SAT where the task is to count the number of satisfying truth assignments of a Boolean function…