4 papers
Key Principles in Cross-Domain Hyper-Heuristic Performance
Václav Sobotka, Lucas Kletzander, Nysret Musliu +1
Cross-domain selection hyper-heuristics aim to distill decades of research on problem-specific heuristic search algorithms into adaptable general-purpose search strategies. In this…
Decomposition, Reformulation, and Diving in University Course Timetabling
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes +1
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of…
On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes +1
Vertex colouring is a well-known problem in combinatorial optimisation, whose alternative integer programming formulations have recently attracted considerable attention. This pape…
Soft Scheduling
Hana Rudova
Classical notions of disjunctive and cumulative scheduling are studied from the point of view of soft constraint satisfaction. Soft disjunctive scheduling is introduced as an insta…