CONFIGURATION Struct Reference

Detailed Description

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

Definition at line 547 of file branch_lookahead.c.

Data Fields
SCIP_Longint	reevalage
int	maxnviolatedcons
int	maxnviolatedbincons
int	maxnviolateddomreds
int	recursiondepth
int	maxncands
SCIP_Bool	usedomainreduction
SCIP_Bool	usebincons
int	addbinconsrow
SCIP_Bool	stopbranching
SCIP_Bool	forcebranching
SCIP_Bool	addnonviocons
SCIP_Bool	abbreviated
SCIP_Bool	reusebasis
SCIP_Bool	storeunviolatedsol
SCIP_Bool	abbrevpseudo
SCIP_Bool	addclique
SCIP_Bool	propagate
int	maxproprounds
char	scoringfunction
SCIP_Real	minweight
SCIP_Real	maxweight

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 549 of file branch_lookahead.c.

Referenced by isBranchFurtherLoopDecrement().

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 551 of file branch_lookahead.c.

Referenced by configurationCreate(), and 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 554 of file branch_lookahead.c.

Referenced by configurationCreate(), and 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 556 of file branch_lookahead.c.

Referenced by configurationCreate(), and selectVarRecursive().

recursiondepth

int CONFIGURATION::recursiondepth

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

Definition at line 558 of file branch_lookahead.c.

Referenced by selectVarStart().

maxncands

int CONFIGURATION::maxncands

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

Definition at line 559 of file branch_lookahead.c.

usedomainreduction

SCIP_Bool CONFIGURATION::usedomainreduction

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

Definition at line 560 of file branch_lookahead.c.

Referenced by selectVarRecursive(), and selectVarStart().

usebincons

SCIP_Bool CONFIGURATION::usebincons

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

Definition at line 562 of file branch_lookahead.c.

Referenced by executeBranchingRecursive(), selectVarRecursive(), and selectVarStart().

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 564 of file branch_lookahead.c.

Referenced by configurationCreate().

stopbranching

SCIP_Bool CONFIGURATION::stopbranching

indicates whether we should stop the first level branching after finding an infeasible first branch

Definition at line 566 of file branch_lookahead.c.

forcebranching

SCIP_Bool CONFIGURATION::forcebranching

Execute the lookahead logic even if only one branching candidate is given. May be used to calculate the score of a single candidate.

Definition at line 568 of file branch_lookahead.c.

Referenced by configurationCreate(), and selectVarStart().

addnonviocons

SCIP_Bool CONFIGURATION::addnonviocons

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

Definition at line 570 of file branch_lookahead.c.

Referenced by configurationCreate().

abbreviated

SCIP_Bool CONFIGURATION::abbreviated

Should the abbreviated version be used?

Definition at line 571 of file branch_lookahead.c.

Referenced by executeBranchingRecursive(), selectVarRecursive(), and selectVarStart().

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 572 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 574 of file branch_lookahead.c.

abbrevpseudo

SCIP_Bool CONFIGURATION::abbrevpseudo

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

Definition at line 576 of file branch_lookahead.c.

addclique

SCIP_Bool CONFIGURATION::addclique

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

Definition at line 578 of file branch_lookahead.c.

propagate

SCIP_Bool CONFIGURATION::propagate

Should the problem be propagated before solving each inner node?

Definition at line 579 of file branch_lookahead.c.

maxproprounds

int CONFIGURATION::maxproprounds

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

Definition at line 580 of file branch_lookahead.c.

scoringfunction

char CONFIGURATION::scoringfunction

selected scoring function

Definition at line 582 of file branch_lookahead.c.

minweight

SCIP_Real CONFIGURATION::minweight

weight of the min gain of two child problems

Definition at line 583 of file branch_lookahead.c.

maxweight

SCIP_Real CONFIGURATION::maxweight

weight of the max gain of two child problems

Definition at line 584 of file branch_lookahead.c.