## Detailed Description

The parameter that can be changed by the user/caller and alter the behaviour of the lookahead branching.

Definition at line 1010 of file branch_lookahead.c.

## Field Documentation

## ◆ reevalage

SCIP_Longint CONFIGURATION::reevalage |

The number of "normal" (not probing) lps that may have been solved before we stop using old data and start recalculating new first level data.

Definition at line 1012 of file branch_lookahead.c.

Referenced by isUseOldBranching().

## ◆ reevalagefsb

SCIP_Longint CONFIGURATION::reevalagefsb |

The number of "normal" (not probing) lps that may have been solved before we stop using old FSB data and start recalculating new first level data.

Definition at line 1014 of file branch_lookahead.c.

## ◆ maxnviolatedcons

int CONFIGURATION::maxnviolatedcons |

The number of constraints (domain reductions and binary constraints) we want to gather before restarting the run. Set to -1 for an unbounded number of constraints.

Definition at line 1016 of file branch_lookahead.c.

Referenced by selectVarRecursive().

## ◆ maxnviolatedbincons

int CONFIGURATION::maxnviolatedbincons |

The number of binary constraints we want to gather before restarting the run. Set to -1 for an undbounded number of binary constraints.

Definition at line 1019 of file branch_lookahead.c.

Referenced by selectVarRecursive().

## ◆ maxnviolateddomreds

int CONFIGURATION::maxnviolateddomreds |

The number of domain reductions we want to gather before restarting the run. Set to -1 for an undbounded number of domain reductions.

Definition at line 1021 of file branch_lookahead.c.

Referenced by selectVarRecursive().

## ◆ recursiondepth

int CONFIGURATION::recursiondepth |

How deep should the recursion go? Default for Lookahead: 2

Definition at line 1023 of file branch_lookahead.c.

Referenced by getFSBResult().

## ◆ maxncands

int CONFIGURATION::maxncands |

If abbreviated == TRUE, at most how many candidates should be handled at the base node?

Definition at line 1024 of file branch_lookahead.c.

Referenced by filterCandidates().

## ◆ maxndeepercands

int CONFIGURATION::maxndeepercands |

If abbreviated == TRUE, at most how many candidates should be handled in deeper nodes?

Definition at line 1025 of file branch_lookahead.c.

Referenced by filterCandidates().

## ◆ usedomainreduction

SCIP_Bool CONFIGURATION::usedomainreduction |

indicates whether the data for domain reductions should be gathered and used.

Definition at line 1026 of file branch_lookahead.c.

Referenced by selectVarRecursive().

## ◆ mergedomainreductions

SCIP_Bool CONFIGURATION::mergedomainreductions |

should domain reductions of feasible siblings should be merged?

Definition at line 1028 of file branch_lookahead.c.

Referenced by selectVarRecursive().

## ◆ prefersimplebounds

SCIP_Bool CONFIGURATION::prefersimplebounds |

should domain reductions only be applied if there are simple bound changes?

Definition at line 1029 of file branch_lookahead.c.

Referenced by selectVarRecursive().

## ◆ onlyvioldomreds

SCIP_Bool CONFIGURATION::onlyvioldomreds |

Should only domain reductions that violate the LP solution be applied?

Definition at line 1030 of file branch_lookahead.c.

## ◆ usebincons

SCIP_Bool CONFIGURATION::usebincons |

indicates whether the data for the implicit binary constraints should be gathered and used

Definition at line 1031 of file branch_lookahead.c.

## ◆ addbinconsrow

int CONFIGURATION::addbinconsrow |

should binary constraints be added as rows to the base LP? (0: no, 1: separate, 2: as initial rows)

Definition at line 1033 of file branch_lookahead.c.

## ◆ addnonviocons

SCIP_Bool CONFIGURATION::addnonviocons |

Should constraints be added, that are not violated by the base LP?

Definition at line 1035 of file branch_lookahead.c.

## ◆ abbreviated

SCIP_Bool CONFIGURATION::abbreviated |

Should the abbreviated version be used?

Definition at line 1036 of file branch_lookahead.c.

Referenced by filterCandidates(), and selectVarRecursive().

## ◆ reusebasis

SCIP_Bool CONFIGURATION::reusebasis |

If abbreviated == TRUE, should the solution lp-basis of the FSB run be used in the first abbreviated level?

Definition at line 1037 of file branch_lookahead.c.

Referenced by executeBranchingRecursive().

## ◆ storeunviolatedsol

SCIP_Bool CONFIGURATION::storeunviolatedsol |

Should a solution/decision be stored, to speed up the next iteration after adding the constraints/domreds?

Definition at line 1039 of file branch_lookahead.c.

Referenced by selectVarRecursive().

## ◆ abbrevpseudo

SCIP_Bool CONFIGURATION::abbrevpseudo |

If abbreviated == TRUE, should pseudocost values be used, to approximate the scoring?

Definition at line 1041 of file branch_lookahead.c.

Referenced by ensureScoresPresent().

## ◆ level2avgscore

SCIP_Bool CONFIGURATION::level2avgscore |

should the average score be used for uninitialized scores in level 2?

Definition at line 1043 of file branch_lookahead.c.

Referenced by ensureScoresPresent().

## ◆ level2zeroscore

SCIP_Bool CONFIGURATION::level2zeroscore |

should uninitialized scores in level 2 be set to zero?

Definition at line 1044 of file branch_lookahead.c.

Referenced by ensureScoresPresent().

## ◆ addclique

SCIP_Bool CONFIGURATION::addclique |

add binary constraints with two variables found at the root node also as a clique?

Definition at line 1045 of file branch_lookahead.c.

## ◆ propagate

SCIP_Bool CONFIGURATION::propagate |

Should the problem be propagated before solving each inner node?

Definition at line 1046 of file branch_lookahead.c.

## ◆ uselevel2data

SCIP_Bool CONFIGURATION::uselevel2data |

should branching data generated at depth level 2 be stored for re-using it?

Definition at line 1047 of file branch_lookahead.c.

## ◆ applychildbounds

SCIP_Bool CONFIGURATION::applychildbounds |

should bounds known for child nodes be applied?

Definition at line 1048 of file branch_lookahead.c.

## ◆ enforcemaxdomreds

SCIP_Bool CONFIGURATION::enforcemaxdomreds |

should the maximum number of domain reductions maxnviolateddomreds be enforced?

Definition at line 1049 of file branch_lookahead.c.

Referenced by selectVarRecursive().

## ◆ updatebranchingresults

SCIP_Bool CONFIGURATION::updatebranchingresults |

should branching results (and scores) be updated w.r.t. proven dual bounds?

Definition at line 1050 of file branch_lookahead.c.

Referenced by selectVarRecursive().

## ◆ inscoring

SCIP_Bool CONFIGURATION::inscoring |

are we currently in FSB-scoring (only used internally)

Definition at line 1051 of file branch_lookahead.c.

Referenced by executeBranchingRecursive(), getFSBResult(), isBranchFurtherLoopDecrement(), and selectVarRecursive().

## ◆ maxproprounds

int CONFIGURATION::maxproprounds |

maximum number of propagation rounds to perform at temporary nodes (-1: unlimited, 0: SCIP default)

Definition at line 1052 of file branch_lookahead.c.

## ◆ scoringfunction

char CONFIGURATION::scoringfunction |

scoring function at base level

Definition at line 1054 of file branch_lookahead.c.

## ◆ deeperscoringfunction

char CONFIGURATION::deeperscoringfunction |

scoring function at deeper levels

Definition at line 1055 of file branch_lookahead.c.

## ◆ scoringscoringfunction

char CONFIGURATION::scoringscoringfunction |

scoring function for FSB scoring

Definition at line 1056 of file branch_lookahead.c.

## ◆ minweight

SCIP_Real CONFIGURATION::minweight |

weight of the min gain of two child problems

Definition at line 1057 of file branch_lookahead.c.

## ◆ worsefactor

SCIP_Real CONFIGURATION::worsefactor |

if the FSB score is of a candidate is worse than the best by this factor, skip this candidate (-1: disable)

Definition at line 1058 of file branch_lookahead.c.

Referenced by filterCandidates().

## ◆ filterbymaxgain

SCIP_Bool CONFIGURATION::filterbymaxgain |

should lookahead branching only be applied if the max gain in level 1 is not uniquely that of the best candidate?

Definition at line 1059 of file branch_lookahead.c.

Referenced by filterCandidates().