Searched for: department%3A%22Algorithmics%22
(1 - 5 of 5)
document
Van den Heuvel, D. (author)
Sometimes a complex combinatorial problem has easily identifiable subproblems for which methods are available. Often, strong interactions between these subproblems prevent us to use these methods in a straightforward way. In railway industry, finding a schedule for train service and shunting tasks is an example of such a problem with clearly...
master thesis 2017
document
Bakker, K.C. (author), Bouter, P.A. (author), Den Hoedt, M. (author)
Het bedrijf NedTrain beschikt over software om roosterproblemen op te lossen. De wens van NedTrain en het doel van dit project is om deze software uit te breiden met de functionaliteit om flexibele schema's te berekenen. Deze roosterproblemen hebben te maken met het probleem dat ook wel bekend staat als het Resource Constrained Project...
bachelor thesis 2014
document
Van der Tak, P. (author)
Recent work introduced the cube-and-conquer technique to solve hard SAT instances. It combines the two dominant SAT solving techniques: lookahead and conflict-driven clause learning (CDCL). First, it partitions the search space into so called cubes using a lookahead solver. Each cube is tackled by a conflict-driven clause learning solver....
master thesis 2012
document
Ridder, B.C. (author)
In this document we will continue a line of research which focusses on reviving partial order planning. We will look at the latest pair of partial order planners, RePOP and VHPOP which both use techniques developed for state-space planners in an attempt to make partial order planning competitive with state of the art state-space planners. We...
master thesis 2010
document
Schaafsma, B.J. (author)
We present a new method to break symmetry in graph coloring problems, which can be applied in many classes of combinatorial problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we developed a learning scheme that translates each encountered conflict into one conflict clause which covers...
master thesis 2009
Searched for: department%3A%22Algorithmics%22
(1 - 5 of 5)