Value Ordering for Finding All Solutions
نویسندگان
چکیده
In finding all solutions to a constraint satisfaction problem, or proving that there are none, with a search algorithm that backtracks chronologically and forms k-way branches, the order in which the values are assigned is immaterial. However, we show that if the values of a variable are assigned instead via a sequence of binary choice points, and the removal of the value just tried from the domain of the variable is propagated before another value is selected, the value ordering can affect the search effort. We show that this depends on the problem constraints; for some types of constraints, we show that the savings in search effort can be significant, given a good value ordering.
منابع مشابه
Value Ordering for Finding All Solutions: Interactions with Adaptive Variable Ordering
We consider the impact of value ordering heuristics on the search effort required to find all solutions, or proving none exist, to a constraint satisfaction problem in k-way branching search. We show that when the variable ordering heuristic is adaptive, the order in which the values are assigned to variables can make a significant difference in all measures of search effort. We study in depth ...
متن کاملA single-vendor and a single-buyer integrated inventory model with ordering cost reduction dependent on lead time
Lead time is one of the major limits that affect planning at every stage of the supply chain system. In this paper, we study a continuous review inventory model. This paper investigates the ordering cost reductions are dependent on lead time. This study addressed two-echelon supply chain problem consisting of a single vendor and a single buyer. The main contribution of this study is that the in...
متن کاملAn Empirical Investigation of Value Ordering for Finding All Solutions
Traditional backtracking search algorithms for solving constraint satisfaction problems select a variable and then construct a separate branch for each value in the variable’s domain: the order in which the values are assigned then has no effect on the overall search, when finding all solutions. Constraint solvers such as ILOG Solver and ECLPS instead use binary branching in constructing search...
متن کاملOptimality conditions for approximate solutions of vector optimization problems with variable ordering structures
We consider nonconvex vector optimization problems with variable ordering structures in Banach spaces. Under certain boundedness and continuity properties we present necessary conditions for approximate solutions of these problems. Using a generic approach to subdifferentials we derive necessary conditions for approximate minimizers and approximately minimal solutions of vector optimizatio...
متن کاملHistogram Arc Consistency as a Value Ordering Heuristic
The Constraint Satisfaction Problem (CSP:I is NP-hard. Finding solutions requires searching in an exponential space of possible variable assignments. Good value ordering heuristics are essential for finding solutions to CSPs. Such heuristics estimate the probability that any particular variable assignment will appear in a globally consistent solution. Unfortunately, computing solution probabili...
متن کامل