|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface ValueSelection
Value selection criterion.
After a variable is selected, we need to find a value to be assigned to the variable. This problem is usually called
"value selection" in constraint programming. Typically, the most useful advice is to select the best-fit value.
So, we are looking for a value which is the most preferred for the variable and which causes the least trouble as well.
This means that we need to find a value with the minimal potential for future conflicts with other variables.
For example, a value which violates the smallest number of soft constraints can be selected among those with
the smallest number of hard conflicts.
The task of this criterion is to select a value of the given variable which will be assigned to this variable.
Solver
Method Summary | |
---|---|
void |
init(Solver solver)
Initialization |
Value |
selectValue(Solution solution,
Variable selectedVariable)
Value selection |
Method Detail |
---|
void init(Solver solver)
Value selectValue(Solution solution, Variable selectedVariable)
solution
- current solutionselectedVariable
- selected variable
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |