Generated on Mon Aug 25 11:35:47 2008 for Gecode by doxygen 1.5.6

Branching
[Using finite domain integers]


Enumerations

enum  Gecode::IntVarBranch {
  Gecode::INT_VAR_NONE, Gecode::INT_VAR_MIN_MIN, Gecode::INT_VAR_MIN_MAX, Gecode::INT_VAR_MAX_MIN,
  Gecode::INT_VAR_MAX_MAX, Gecode::INT_VAR_SIZE_MIN, Gecode::INT_VAR_SIZE_MAX, Gecode::INT_VAR_DEGREE_MIN,
  Gecode::INT_VAR_DEGREE_MAX, Gecode::INT_VAR_SIZE_DEGREE_MIN, Gecode::INT_VAR_SIZE_DEGREE_MAX, Gecode::INT_VAR_REGRET_MIN_MIN,
  Gecode::INT_VAR_REGRET_MIN_MAX, Gecode::INT_VAR_REGRET_MAX_MIN, Gecode::INT_VAR_REGRET_MAX_MAX
}
 Which variable to select for branching. More...
enum  Gecode::IntValBranch {
  Gecode::INT_VAL_MIN, Gecode::INT_VAL_MED, Gecode::INT_VAL_MAX, Gecode::INT_VAL_SPLIT_MIN,
  Gecode::INT_VAL_SPLIT_MAX
}
 Which values to select first for branching. More...

Functions

void Gecode::branch (Space *home, const IntVarArgs &x, IntVarBranch vars, IntValBranch vals)
 Branch over x with variable selection vars and value selection vals.


Enumeration Type Documentation

Which variable to select for branching.

Enumerator:
INT_VAR_NONE  First unassigned.
INT_VAR_MIN_MIN  With smallest min.
INT_VAR_MIN_MAX  With largest min.
INT_VAR_MAX_MIN  With smallest max.
INT_VAR_MAX_MAX  With largest max.
INT_VAR_SIZE_MIN  With smallest domain size.
INT_VAR_SIZE_MAX  With largest domain size.
INT_VAR_DEGREE_MIN  With smallest degree.

The degree of a variable is defined as the number of dependant propagators. In case of ties, choose the variable with smallest domain.

INT_VAR_DEGREE_MAX  With largest degree.

The degree of a variable is defined as the number of dependant propagators. In case of ties, choose the variable with smallest domain.

INT_VAR_SIZE_DEGREE_MIN  With smallest domain size divided by degree.
INT_VAR_SIZE_DEGREE_MAX  With largest domain size divided by degree.
INT_VAR_REGRET_MIN_MIN  With smallest min-regret.

The min-regret of a variable is the difference between the smallest and second-smallest value still in the domain.

INT_VAR_REGRET_MIN_MAX  With largest min-regret.

The min-regret of a variable is the difference between the smallest and second-smallest value still in the domain.

INT_VAR_REGRET_MAX_MIN  With smallest max-regret.

The max-regret of a variable is the difference between the largest and second-largest value still in the domain.

INT_VAR_REGRET_MAX_MAX  With largest max-regret.

The max-regret of a variable is the difference between the largest and second-largest value still in the domain.

Definition at line 2007 of file int.hh.

Which values to select first for branching.

Enumerator:
INT_VAL_MIN  Select smallest value.
INT_VAL_MED  Select median value.
INT_VAL_MAX  Select maximal value.
INT_VAL_SPLIT_MIN  Select lower half of domain.
INT_VAL_SPLIT_MAX  Select upper half of domain.

Definition at line 2058 of file int.hh.


Function Documentation

void Gecode::branch ( Space *  home,
const IntVarArgs &  x,
IntVarBranch  vars,
IntValBranch  vals 
)

Branch over x with variable selection vars and value selection vals.

Definition at line 45 of file branch.cc.