main page modules namespaces classes files
Gecode/J home

Branching
[Using finite domain integers]

Collaboration diagram for Branching:

Enumerations
enum	org::gecode.IntAssign
	Which values to select first for branching. More...
enum	org::gecode.IntValBranch
	Which values to select first for branching. More...
enum	org::gecode.IntVarBranch
	Which variable to select for branching. More...
Functions
static synchronized void	org::gecode::Gecode.branch (JavaSpace home, VarArray<?extends IntVar > arg1, IntVarBranch arg2, IntValBranch arg3)
	Branch over all x with variable selection vars and value selection vals.
static synchronized void	org::gecode::Gecode.assign (JavaSpace home, VarArray<?extends IntVar > arg1, IntAssign arg2)
	Assign all x with value selection vals.

---

Enumeration Type Documentation

enum org::gecode::IntAssign

Which values to select first for branching.

• INT_ASSIGN_MIN: Select smallest value
• INT_ASSIGN_MED: Select median value
• INT_ASSIGN_MAX: Select maximal value

Enumerator:

INT_ASSIGN_MIN
INT_ASSIGN_MED
INT_ASSIGN_MAX

Definition at line 20 of file IntAssign.java.

enum org::gecode::IntValBranch

Which values to select first for branching.

• 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

Enumerator:

INT_VAL_MIN
INT_VAL_MED
INT_VAL_MAX
INT_VAL_SPLIT_MIN
INT_VAL_SPLIT_MAX

Definition at line 22 of file IntValBranch.java.

enum org::gecode::IntVarBranch

Which variable to select for branching.

• 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.

Enumerator:

INT_VAR_NONE
INT_VAR_MIN_MIN
INT_VAR_MIN_MAX
INT_VAR_MAX_MIN
INT_VAR_MAX_MAX
INT_VAR_SIZE_MIN
INT_VAR_SIZE_MAX
INT_VAR_DEGREE_MIN
INT_VAR_DEGREE_MAX
INT_VAR_SIZE_DEGREE_MIN
INT_VAR_SIZE_DEGREE_MAX
INT_VAR_REGRET_MIN_MIN
INT_VAR_REGRET_MIN_MAX
INT_VAR_REGRET_MAX_MIN
INT_VAR_REGRET_MAX_MAX

Definition at line 47 of file IntVarBranch.java.

---

Function Documentation

static synchronized void org.gecode.Gecode.branch	(	JavaSpace	home,
		VarArray<?extends IntVar >	arg1,
		IntVarBranch	arg2,
		IntValBranch	arg3
	)			[static, inherited]

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

Definition at line 2156 of file Gecode.java.

static synchronized void org.gecode.Gecode.assign	(	JavaSpace	home,
		VarArray<?extends IntVar >	arg1,
		IntAssign	arg2
	)			[static, inherited]

Assign all x with value selection vals.

Definition at line 2165 of file Gecode.java.