We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
OneClassMaxMinOver (OMMO) is a simple incremental algorithm for one-class support vector classification. We propose several enhancements and heuristics for improving model select...
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
Edmund K. Burke, Barry McCollum, Amnon Meisels, Sa...
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...