Dependency Directed Backtracking in Generalized Satisficing Assignment Problems
17 Pages Posted: 31 Oct 2008
Date Written: August 1990
Abstract
Many authors have described search techniques for the satisficing assignment problem: the problem offinding an interpretation for a set of discrete variables that satisfies a given set of constraints. In this paperwe present a formal specification of dependency directed backtracking as applied to this problem. Wealso generalize the satisficing assignment problem to include limited resource constraints that arise inoperations research and industrial engineering. We discuss several new search heuristics that can beapplied to this generalized problem, and give some empirical results on the performance of theseheuristics.
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
An Approach to Dependency Directed Backtracking Using Domain Specific Knowledge
By Vasant Dhar and Casey Quayle
-
Rule-Based Versus Structure-Based Models for Explaining and Generating Expert Behavior
By Vasant Dhar and Harry E. Pople
-
A Problem-Solver/Tms Architecture for General Constraint Satisfaction Problems
By Albert Croker and Vasant Dhar