## Detailed Description

all domain reductions found through cutoff of branches

Definition at line 1708 of file branch_lookahead.c.

## Data Fields | |

SCIP_Real * | lowerbounds |

SCIP_Real * | upperbounds |

SCIP_Shortbool * | baselpviolated |

int | nviolatedvars |

int | nchangedvars |

int | nsimplebounds |

## Field Documentation

## ◆ lowerbounds

SCIP_Real* DOMAINREDUCTIONS::lowerbounds |

The new lower bounds found for each variable in the problem.

Definition at line 1710 of file branch_lookahead.c.

Referenced by selectVarRecursive().

## ◆ upperbounds

SCIP_Real* DOMAINREDUCTIONS::upperbounds |

The new upper bounds found for each variable in the problem.

Definition at line 1711 of file branch_lookahead.c.

Referenced by selectVarRecursive().

## ◆ baselpviolated

SCIP_Shortbool* DOMAINREDUCTIONS::baselpviolated |

Indicates whether the base lp solution violates the new bounds of a var.

Definition at line 1712 of file branch_lookahead.c.

## ◆ nviolatedvars

int DOMAINREDUCTIONS::nviolatedvars |

Tracks the number of vars that have a violated (by the base lp) new lower or upper bound.

Definition at line 1713 of file branch_lookahead.c.

Referenced by selectVarRecursive().

## ◆ nchangedvars

int DOMAINREDUCTIONS::nchangedvars |

Tracks the number of vars, that have a changed domain. (a change on both, upper and lower bound, counts as one.)

Definition at line 1715 of file branch_lookahead.c.

Referenced by selectVarRecursive().

## ◆ nsimplebounds

int DOMAINREDUCTIONS::nsimplebounds |

number of changed bounds resulting from infeasible child nodes

Definition at line 1717 of file branch_lookahead.c.

Referenced by selectVarRecursive().