Computer Science and Engineering, Department of
First Advisor
Berthe Y. Choueiry
Date of this Version
5-2018
Citation
Daniel J. Geschwender. Effectively Enforcing Minimality During Backtrack Search. MS thesis, University of Nebraska-Lincoln, 2018.
Abstract
Constraint Processing is an expressive and powerful framework for modeling and solving combinatorial decision problems. Enforcing consistency during backtrack search is an effective technique for reducing thrashing in a large search tree. The higher the level of the consistency enforced, the stronger the pruning of inconsistent subtrees. Recently, high-level consistencies (HLC) were shown to be instrumental for solving difficult instances. In particular, minimality, which is guaranteed to prune all inconsistent branches, is advantageous even when enforced locally. In this thesis, we study two algorithms for computing minimality and propose three new mechanisms that significantly improve performance. Then, we integrate the resulting algorithms in a portfolio that operates both locally and dynamically during search. Finally, we empirically evaluate the performance of our approach on benchmark problems.
Adviser: Berthe Y. Choueiry
Comments
A THESIS Presented to the Faculty of The Graduate College at the University of Nebraska In Partial Fulfilment of Requirements For the Degree of Master of Science, Major: Computer Science, Under the Supervision of Professor Berthe Y. Choueiry. Lincoln, Nebraska: May, 2018.
Copyright (c) 2018 Daniel J. Geschwender