SCIP_HeurData Struct Reference

Detailed Description

DINS primal heuristic data

primal heuristic data

Definition at line 74 of file heur_gcgdins.c.

Public Member Functions
	GCG_DECL_DIVINGFREE ((*divingfree))
	GCG_DECL_DIVINGINIT ((*divinginit))
	GCG_DECL_DIVINGEXIT ((*divingexit))
	GCG_DECL_DIVINGINITSOL ((*divinginitsol))
	GCG_DECL_DIVINGEXITSOL ((*divingexitsol))
	GCG_DECL_DIVINGINITEXEC ((*divinginitexec))
	GCG_DECL_DIVINGEXITEXEC ((*divingexitexec))
	GCG_DECL_DIVINGSELECTVAR ((*divingselectvar))
	GCG_DECL_DIVINGFREE ((*divingfree))
	GCG_DECL_DIVINGINIT ((*divinginit))
	GCG_DECL_DIVINGEXIT ((*divingexit))
	GCG_DECL_DIVINGINITSOL ((*divinginitsol))
	GCG_DECL_DIVINGEXITSOL ((*divingexitsol))
	GCG_DECL_DIVINGINITEXEC ((*divinginitexec))
	GCG_DECL_DIVINGEXITEXEC ((*divingexitexec))
	GCG_DECL_DIVINGSELECTVAR ((*divingselectvar))

Data Fields
SCIP_Longint	nodesofs
SCIP_Longint	maxnodes
SCIP_Longint	minnodes
SCIP_Longint	nwaitingnodes
SCIP_Real	minimprove
SCIP_Longint	usednodes
SCIP_Real	nodesquot
int	neighborhoodsize
SCIP_Bool *	delta
int	deltalength
SCIP_Longint	lastnsolsfound
int	solnum
SCIP_Bool	uselprows
SCIP_Bool	copycuts
SCIP_SOL *	rootsol
SCIP_Bool	firstrun
SCIP_SOL *	sol
SCIP_SOL *	roundedsol
SCIP_Longint	nlpiterations
SCIP_Real	maxlpiterquot
SCIP_Real	objfactor
SCIP_Real	alphadiff
int	maxlpiterofs
int	maxsols
int	maxloops
int	maxstallloops
int	minflips
int	cyclelength
int	perturbfreq
int	nsuccess
SCIP_RANDNUMGEN *	randnumgen
SCIP_Bool	usefp20
SCIP_Bool	pertsolfound
SCIP_Bool	stage3
SCIP_Real	minfixingrate
SCIP_Bool	binarybounds
SCIP_Bool	addallsols
int	nodesofs
int	maxnodes
int	minnodes
int	nwaitingnodes
SCIP_Longint	lastlp
int	successfactor
int	nroundablevars
int	maxroundingloops
SCIP_Bool	stopziround
SCIP_Real	stoppercentage
int	minstopncalls
int	mincolumns
SCIP_Bool	useobj
SCIP_VAR **	zerovars
int	maxzerovars
int	lastncols
GCG_DIVINGDATA *	divingdata
SCIP_Real	minreldepth
SCIP_Real	maxreldepth
int	maxpricerounds
SCIP_Bool	usefarkasonly
SCIP_Real	maxdiveubquot
SCIP_Real	maxdiveavgquot
SCIP_Real	maxdiveubquotnosol
SCIP_Real	maxdiveavgquotnosol
SCIP_Bool	backtrack
int	maxdiscrepancy
int	maxdiscdepth
SCIP_Longint	npricerounds
SCIP_Bool	otherdirection
SCIP_Bool	pbheur
int	param_core_tent_size
SCIP_Bool	param_lambda_adjustments
int	param_lambda_p
SCIP_Real	param_lambda
int	param_stop_crit_iter
SCIP_Real	param_stop_crit_diff
SCIP_Real	param_stop_crit_ratio
SCIP_Real	param_pi_min
SCIP_Real	param_pi_alpha
SCIP_Real	param_beta
int	param_max_iter
int	param_max_iter_no_imp
int	param_threephase_max_iter
int	param_greedy_max_iter
int	param_min_prob_size
SCP_CORE	core
SCP_INSTANCE	inst
SCP_INSTANCE	subinst
SCP_Lagrange_Sol	multbestlbtotal
SCP_Lagrange_Sol	multbestlbinst
SCP_Lagrange_Sol	multbestlbsubinst
SCIP_Real	bestub
SCIP_Bool *	bestubsol
SCIP_Real	bestubinst
SCIP_Bool *	bestubinst_sol
SCIP_Real	bestubsubinst
SCIP_Bool *	bestubsubinstsol
SCIP_VAR **	vars
SCP_Lagrange_Sol	tpmultlbsubinst
SCIP_Bool	useinitialmultiplier
PQUEUE	greedyqueue
int *	greedycolpos
int *	greedycolmu
SCIP_Real *	greedycolgamma
SCIP_Real *	greedycolscore
SCP_INSTANCE	greedyinst
int *	rccols
SCIP_Real *	rccoldelta
SCIP_Real *	sglastlb
int	nusedpts
unsigned int	nfailures
SCIP_Longint	nextnodenumber
SCIP_Bool	randomization
SCIP_HASHTABLE *	hashtable
POINTTUPLE *	lasttuple
SCIP_Real	equalityrate

Member Function Documentation

GCG_DECL_DIVINGFREE() [1/2]

SCIP_HeurData::GCG_DECL_DIVINGFREE

(

*

divingfree

)

destructor of diving heuristic

GCG_DECL_DIVINGINIT() [1/2]

SCIP_HeurData::GCG_DECL_DIVINGINIT

(

*

divinginit

)

initialize diving heuristic

GCG_DECL_DIVINGEXIT() [1/2]

SCIP_HeurData::GCG_DECL_DIVINGEXIT

(

*

divingexit

)

deinitialize diving heuristic

GCG_DECL_DIVINGINITSOL() [1/2]

SCIP_HeurData::GCG_DECL_DIVINGINITSOL

(

*

divinginitsol

)

solving process initialization method of diving heuristic

GCG_DECL_DIVINGEXITSOL() [1/2]

SCIP_HeurData::GCG_DECL_DIVINGEXITSOL

(

*

divingexitsol

)

solving process deinitialization method of diving heuristic

GCG_DECL_DIVINGINITEXEC() [1/2]

SCIP_HeurData::GCG_DECL_DIVINGINITEXEC

(

*

divinginitexec

)

execution initialization method of diving heuristic

GCG_DECL_DIVINGEXITEXEC() [1/2]

SCIP_HeurData::GCG_DECL_DIVINGEXITEXEC

(

*

divingexitexec

)

execution deinitialization method of diving heuristic

GCG_DECL_DIVINGSELECTVAR() [1/2]

SCIP_HeurData::GCG_DECL_DIVINGSELECTVAR

(

*

divingselectvar

)

variable selection method of diving heuristic

GCG_DECL_DIVINGFREE() [2/2]

SCIP_HeurData::GCG_DECL_DIVINGFREE

(

*

divingfree

)

destructor of diving heuristic

GCG_DECL_DIVINGINIT() [2/2]

SCIP_HeurData::GCG_DECL_DIVINGINIT

(

*

divinginit

)

initialize diving heuristic

GCG_DECL_DIVINGEXIT() [2/2]

SCIP_HeurData::GCG_DECL_DIVINGEXIT

(

*

divingexit

)

deinitialize diving heuristic

GCG_DECL_DIVINGINITSOL() [2/2]

SCIP_HeurData::GCG_DECL_DIVINGINITSOL

(

*

divinginitsol

)

solving process initialization method of diving heuristic

GCG_DECL_DIVINGEXITSOL() [2/2]

SCIP_HeurData::GCG_DECL_DIVINGEXITSOL

(

*

divingexitsol

)

solving process deinitialization method of diving heuristic

GCG_DECL_DIVINGINITEXEC() [2/2]

SCIP_HeurData::GCG_DECL_DIVINGINITEXEC

(

*

divinginitexec

)

execution initialization method of diving heuristic

GCG_DECL_DIVINGEXITEXEC() [2/2]

SCIP_HeurData::GCG_DECL_DIVINGEXITEXEC

(

*

divingexitexec

)

execution deinitialization method of diving heuristic

GCG_DECL_DIVINGSELECTVAR() [2/2]

SCIP_HeurData::GCG_DECL_DIVINGSELECTVAR

(

*

divingselectvar

)

variable selection method of diving heuristic

Field Documentation

nodesofs [1/2]

SCIP_Longint SCIP_HeurData::nodesofs

number of nodes added to the contingent of the total nodes

Definition at line 76 of file heur_gcgdins.c.

maxnodes [1/2]

SCIP_Longint SCIP_HeurData::maxnodes

maximum number of nodes to regard in the subproblem

Definition at line 77 of file heur_gcgdins.c.

minnodes [1/2]

SCIP_Longint SCIP_HeurData::minnodes

minimum number of nodes to regard in the subproblem

Definition at line 78 of file heur_gcgdins.c.

nwaitingnodes [1/2]

SCIP_Longint SCIP_HeurData::nwaitingnodes

number of nodes without incumbent change that heuristic should wait

Definition at line 79 of file heur_gcgdins.c.

minimprove

SCIP_Real SCIP_HeurData::minimprove

factor by which DINS should at least improve the incumbent

factor by which RENS should at least improve the incumbent

factor by which RINS should at least improve the incumbent

factor by which restricted master should at least improve the incumbent

factor by which crossover should at least improve the incumbent

factor by which xprins should at least improve the incumbent

Definition at line 80 of file heur_gcgdins.c.

usednodes

SCIP_Longint SCIP_HeurData::usednodes

nodes already used by DINS in earlier calls

nodes already used by RENS in earlier calls

nodes already used by RINS in earlier calls

nodes already used by restricted master in earlier calls

nodes already used by crossover in earlier calls

nodes already used by xprins in earlier calls

Definition at line 81 of file heur_gcgdins.c.

nodesquot

SCIP_Real SCIP_HeurData::nodesquot

subproblem nodes in relation to nodes of the original problem

Definition at line 82 of file heur_gcgdins.c.

neighborhoodsize

int SCIP_HeurData::neighborhoodsize

radius of the incumbent's neighborhood to be searched

radius of the neighborhood to be searched in stage 3

Definition at line 83 of file heur_gcgdins.c.

delta

SCIP_Bool* SCIP_HeurData::delta

stores whether a variable kept its value from root LP all the time

Definition at line 84 of file heur_gcgdins.c.

deltalength

int SCIP_HeurData::deltalength

if there are no binary variables, we need no flag array

Definition at line 85 of file heur_gcgdins.c.

lastnsolsfound

SCIP_Longint SCIP_HeurData::lastnsolsfound

solutions found until the last call of DINS

Definition at line 86 of file heur_gcgdins.c.

solnum

int SCIP_HeurData::solnum

number of pool-solutions to be checked for flag array update

Definition at line 87 of file heur_gcgdins.c.

uselprows

SCIP_Bool SCIP_HeurData::uselprows

should subproblem be created out of the rows in the LP rows?

Definition at line 88 of file heur_gcgdins.c.

copycuts

SCIP_Bool SCIP_HeurData::copycuts

if uselprows == FALSE, should all active cuts from cutpool be copied to constraints in subproblem?

should all active cuts from cutpool be copied to constraints in subproblem?

Definition at line 89 of file heur_gcgdins.c.

rootsol

SCIP_SOL* SCIP_HeurData::rootsol

relaxation solution at the root node

Definition at line 92 of file heur_gcgdins.c.

firstrun

SCIP_Bool SCIP_HeurData::firstrun

is the heuristic running for the first time?

Definition at line 93 of file heur_gcgdins.c.

sol

SCIP_SOL * SCIP_HeurData::sol

working solution

Definition at line 86 of file heur_gcgfeaspump.c.

roundedsol

SCIP_SOL* SCIP_HeurData::roundedsol

rounded solution

Definition at line 87 of file heur_gcgfeaspump.c.

nlpiterations

SCIP_Longint SCIP_HeurData::nlpiterations

number of LP iterations used in this heuristic

LP iterations used in this heuristic

Definition at line 88 of file heur_gcgfeaspump.c.

maxlpiterquot

SCIP_Real SCIP_HeurData::maxlpiterquot

maximal fraction of diving LP iterations compared to node LP iterations

Definition at line 89 of file heur_gcgfeaspump.c.

objfactor

SCIP_Real SCIP_HeurData::objfactor

factor by which the regard of the objective is decreased in each round, 1.0 for dynamic, depending on solutions already found

Definition at line 90 of file heur_gcgfeaspump.c.

alphadiff

SCIP_Real SCIP_HeurData::alphadiff

threshold difference for the convex parameter to perform perturbation

Definition at line 92 of file heur_gcgfeaspump.c.

maxlpiterofs

int SCIP_HeurData::maxlpiterofs

additional number of allowed LP iterations

Definition at line 94 of file heur_gcgfeaspump.c.

maxsols

int SCIP_HeurData::maxsols

total number of feasible solutions found up to which heuristic is called (-1: no limit)

Definition at line 95 of file heur_gcgfeaspump.c.

maxloops

int SCIP_HeurData::maxloops

maximum number of loops (-1: no limit)

Definition at line 97 of file heur_gcgfeaspump.c.

maxstallloops

int SCIP_HeurData::maxstallloops

maximal number of pumping rounds without fractionality improvement (-1: no limit)

Definition at line 98 of file heur_gcgfeaspump.c.

minflips

int SCIP_HeurData::minflips

minimum number of random variables to flip, if a 1-cycle is encountered

Definition at line 99 of file heur_gcgfeaspump.c.

cyclelength

int SCIP_HeurData::cyclelength

maximum length of cycles to be checked explicitly in each round

Definition at line 100 of file heur_gcgfeaspump.c.

perturbfreq

int SCIP_HeurData::perturbfreq

number of iterations until a random perturbation is forced

Definition at line 101 of file heur_gcgfeaspump.c.

nsuccess

int SCIP_HeurData::nsuccess

number of runs that produced at least one feasible solution

Definition at line 102 of file heur_gcgfeaspump.c.

randnumgen

SCIP_RANDNUMGEN * SCIP_HeurData::randnumgen

random number generator

random number generator

Definition at line 105 of file heur_gcgfeaspump.c.

usefp20

SCIP_Bool SCIP_HeurData::usefp20

should an iterative round-and-propagate scheme be used to find the integral points?

Definition at line 106 of file heur_gcgfeaspump.c.

pertsolfound

SCIP_Bool SCIP_HeurData::pertsolfound

should a random perturbation be performed if a feasible solution was found?

Definition at line 107 of file heur_gcgfeaspump.c.

stage3

SCIP_Bool SCIP_HeurData::stage3

should we solve a local branching sub-MIP if no solution could be found?

Definition at line 108 of file heur_gcgfeaspump.c.

minfixingrate

SCIP_Real SCIP_HeurData::minfixingrate

minimum percentage of integer variables that have to be fixed

Definition at line 84 of file heur_gcgrens.c.

binarybounds

SCIP_Bool SCIP_HeurData::binarybounds

should general integers get binary bounds [floor(.),ceil(.)] ?

Definition at line 87 of file heur_gcgrens.c.

addallsols

SCIP_Bool SCIP_HeurData::addallsols

should all subproblem solutions be added to the original SCIP?

Definition at line 92 of file heur_gcgrens.c.

nodesofs [2/2]

int SCIP_HeurData::nodesofs

number of nodes added to the contingent of the total nodes

Definition at line 76 of file heur_gcgrins.c.

maxnodes [2/2]

int SCIP_HeurData::maxnodes

maximum number of nodes to regard in the subproblem

Definition at line 77 of file heur_gcgrins.c.

minnodes [2/2]

int SCIP_HeurData::minnodes

minimum number of nodes to regard in the subproblem

Definition at line 78 of file heur_gcgrins.c.

nwaitingnodes [2/2]

int SCIP_HeurData::nwaitingnodes

number of nodes without incumbent change that heuristic should wait

Definition at line 80 of file heur_gcgrins.c.

lastlp

SCIP_Longint SCIP_HeurData::lastlp

last LP number where the heuristic was applied

the number of the last LP for which ZIRounding was called

Definition at line 63 of file heur_gcgrounding.c.

successfactor

int SCIP_HeurData::successfactor

number of calls per found solution that are considered as standard success, a higher factor causes the heuristic to be called more often

Definition at line 64 of file heur_gcgrounding.c.

nroundablevars

int SCIP_HeurData::nroundablevars

number of variables that can be rounded (-1 if not yet calculated)

Definition at line 59 of file heur_gcgsimplerounding.c.

maxroundingloops

int SCIP_HeurData::maxroundingloops

limits rounding loops in execution

Definition at line 69 of file heur_gcgzirounding.c.

stopziround

SCIP_Bool SCIP_HeurData::stopziround

sets deactivation check

Definition at line 70 of file heur_gcgzirounding.c.

stoppercentage

SCIP_Real SCIP_HeurData::stoppercentage

threshold for deactivation check

Definition at line 71 of file heur_gcgzirounding.c.

minstopncalls

int SCIP_HeurData::minstopncalls

number of heuristic calls before deactivation check

Definition at line 72 of file heur_gcgzirounding.c.

mincolumns

int SCIP_HeurData::mincolumns

minimum number of columns to regard in the master problem

Definition at line 67 of file heur_greedycolsel.c.

useobj

SCIP_Bool SCIP_HeurData::useobj

use objective coefficients as tie breakers

Definition at line 68 of file heur_greedycolsel.c.

zerovars

SCIP_VAR ** SCIP_HeurData::zerovars

array of master variables corresponding to zero solutions

Definition at line 71 of file heur_greedycolsel.c.

maxzerovars

int SCIP_HeurData::maxzerovars

capacity of zerovars

Definition at line 72 of file heur_greedycolsel.c.

lastncols

int SCIP_HeurData::lastncols

number of columns in the last call of the heuristic

Definition at line 73 of file heur_greedycolsel.c.

divingdata

GCG_DIVINGDATA * SCIP_HeurData::divingdata

diving rule specific data

Definition at line 87 of file heur_masterdiving.c.

minreldepth

SCIP_Real SCIP_HeurData::minreldepth

minimal relative depth to start diving

Definition at line 90 of file heur_masterdiving.c.

maxreldepth

SCIP_Real SCIP_HeurData::maxreldepth

maximal relative depth to start diving

Definition at line 91 of file heur_masterdiving.c.

maxpricerounds

int SCIP_HeurData::maxpricerounds

maximal number of allowed pricing rounds (-1: no limit)

Definition at line 94 of file heur_masterdiving.c.

usefarkasonly

SCIP_Bool SCIP_HeurData::usefarkasonly

perform pricing only if infeasibility is encountered

Definition at line 95 of file heur_masterdiving.c.

maxdiveubquot

SCIP_Real SCIP_HeurData::maxdiveubquot

maximal quotient (curlowerbound - lowerbound)/(cutoffbound - lowerbound) where diving is performed (0.0: no limit)

Definition at line 96 of file heur_masterdiving.c.

maxdiveavgquot

SCIP_Real SCIP_HeurData::maxdiveavgquot

maximal quotient (curlowerbound - lowerbound)/(avglowerbound - lowerbound) where diving is performed (0.0: no limit)

Definition at line 98 of file heur_masterdiving.c.

maxdiveubquotnosol

SCIP_Real SCIP_HeurData::maxdiveubquotnosol

maximal UBQUOT when no solution was found yet (0.0: no limit)

Definition at line 100 of file heur_masterdiving.c.

maxdiveavgquotnosol

SCIP_Real SCIP_HeurData::maxdiveavgquotnosol

maximal AVGQUOT when no solution was found yet (0.0: no limit)

Definition at line 101 of file heur_masterdiving.c.

backtrack

SCIP_Bool SCIP_HeurData::backtrack

single backtracking by choosing another variable in case of infeasibility

Definition at line 102 of file heur_masterdiving.c.

maxdiscrepancy

int SCIP_HeurData::maxdiscrepancy

maximal discrepancy allowed in backtracking and limited discrepancy search

Definition at line 103 of file heur_masterdiving.c.

maxdiscdepth

int SCIP_HeurData::maxdiscdepth

maximal depth until which a limited discrepancy search is performed

Definition at line 104 of file heur_masterdiving.c.

npricerounds

SCIP_Longint SCIP_HeurData::npricerounds

pricing rounds used in this heuristic

Definition at line 106 of file heur_masterdiving.c.

otherdirection

SCIP_Bool SCIP_HeurData::otherdirection

try to branch the diving variable in the other direction in case of infeasibility

Definition at line 103 of file heur_origdiving.c.

pbheur

SCIP_Bool SCIP_HeurData::pbheur

value for using the restricted master heuristic as price-and-branch heuristic? (this changes the HEUR_TIMING to SCIP_HEURTIMING_AFTERNODE, and it changes the HEUR_FREQ to 0.

Definition at line 89 of file heur_restmaster.c.

param_core_tent_size

int SCIP_HeurData::param_core_tent_size

number of columns covering each row that are added to the tentative core at the beginning

Definition at line 135 of file heur_setcover.c.

param_lambda_adjustments

SCIP_Bool SCIP_HeurData::param_lambda_adjustments

adjust step size during the subgradient phase

Definition at line 136 of file heur_setcover.c.

param_lambda_p

int SCIP_HeurData::param_lambda_p

number of iterations after which lambda is adjusted

Definition at line 137 of file heur_setcover.c.

param_lambda

SCIP_Real SCIP_HeurData::param_lambda

initial step size for the subgradient phase

Definition at line 138 of file heur_setcover.c.

param_stop_crit_iter

int SCIP_HeurData::param_stop_crit_iter

number of iterations of the subgradient phase after which the stopping criterion is tested again

Definition at line 139 of file heur_setcover.c.

param_stop_crit_diff

SCIP_Real SCIP_HeurData::param_stop_crit_diff

stop if absolute difference between best lower and upper bound is less than SCP_STOP_CRIT_DIFF, and

Definition at line 140 of file heur_setcover.c.

param_stop_crit_ratio

SCIP_Real SCIP_HeurData::param_stop_crit_ratio

the relative gap between best lower and upper bound is less than (1 - SCP_STOP_CRIT_PER

Definition at line 141 of file heur_setcover.c.

param_pi_min

SCIP_Real SCIP_HeurData::param_pi_min

percentage of rows to be removed after fixing columns

Definition at line 142 of file heur_setcover.c.

param_pi_alpha

SCIP_Real SCIP_HeurData::param_pi_alpha

increase of pi when no improvement was made, i.e. more columns will be fixed

Definition at line 143 of file heur_setcover.c.

param_beta

SCIP_Real SCIP_HeurData::param_beta

allowed a gap between lowerbound and upper bound during the subgradient phase

Definition at line 144 of file heur_setcover.c.

param_max_iter

int SCIP_HeurData::param_max_iter

maximum number of iterations of three-phase

Definition at line 145 of file heur_setcover.c.

param_max_iter_no_imp

int SCIP_HeurData::param_max_iter_no_imp

stop of no improvements during the last X iterations of three-phase

Definition at line 146 of file heur_setcover.c.

param_threephase_max_iter

int SCIP_HeurData::param_threephase_max_iter

maximum number of iterations inside three-phase

Definition at line 147 of file heur_setcover.c.

param_greedy_max_iter

int SCIP_HeurData::param_greedy_max_iter

number of multipliers that are used for computing greedy solutions during each iteration

Definition at line 148 of file heur_setcover.c.

param_min_prob_size

int SCIP_HeurData::param_min_prob_size

minimum number of variables the master problem needs to contain before the heuristic starts at all

Definition at line 149 of file heur_setcover.c.

core

SCP_CORE SCIP_HeurData::core

core (subcollection of columns) of the problem covering all rows

Definition at line 151 of file heur_setcover.c.

inst

SCP_INSTANCE SCIP_HeurData::inst

reduced instance where some variables may be fixed and some rows be covered

Definition at line 152 of file heur_setcover.c.

subinst

SCP_INSTANCE SCIP_HeurData::subinst

reduced instance of 'inst', used during the three-phase

Definition at line 153 of file heur_setcover.c.

multbestlbtotal

SCP_Lagrange_Sol SCIP_HeurData::multbestlbtotal

lagrange multiplier that gives the best lower bound for the complete problem

Definition at line 155 of file heur_setcover.c.

multbestlbinst

SCP_Lagrange_Sol SCIP_HeurData::multbestlbinst

best multiplier for instance 'inst'

Definition at line 156 of file heur_setcover.c.

multbestlbsubinst

SCP_Lagrange_Sol SCIP_HeurData::multbestlbsubinst

best multiplier for instance 'subinst'

Definition at line 157 of file heur_setcover.c.

bestub

SCIP_Real SCIP_HeurData::bestub

best upper bound that could be obtained so far

Definition at line 159 of file heur_setcover.c.

bestubsol

SCIP_Bool* SCIP_HeurData::bestubsol

actual solution that gives the best upper bound

Definition at line 160 of file heur_setcover.c.

bestubinst

SCIP_Real SCIP_HeurData::bestubinst

best upper bound for the reduced instance 'inst' (including fixed costs)

Definition at line 161 of file heur_setcover.c.

bestubinst_sol

SCIP_Bool* SCIP_HeurData::bestubinst_sol

actual solution for the instance 'inst' (including fixed variables)

Definition at line 162 of file heur_setcover.c.

bestubsubinst

SCIP_Real SCIP_HeurData::bestubsubinst

best upper bound for the reduced instance 'subinst' (including fixed costs)

Definition at line 163 of file heur_setcover.c.

bestubsubinstsol

SCIP_Bool* SCIP_HeurData::bestubsubinstsol

actual solution for the instance 'subinst' (including fixed variables)

Definition at line 164 of file heur_setcover.c.

vars

SCIP_VAR** SCIP_HeurData::vars

used to iterate through the variables of a constraint

Definition at line 167 of file heur_setcover.c.

tpmultlbsubinst

SCP_Lagrange_Sol SCIP_HeurData::tpmultlbsubinst

lagrange multiplier

Definition at line 170 of file heur_setcover.c.

useinitialmultiplier

SCIP_Bool SCIP_HeurData::useinitialmultiplier

compute an own initial lagrange multiplier instead of using the best known

Definition at line 171 of file heur_setcover.c.

greedyqueue

PQUEUE SCIP_HeurData::greedyqueue

priority queue used by the greedy algorithm

Definition at line 174 of file heur_setcover.c.

greedycolpos

int* SCIP_HeurData::greedycolpos

stores position of a variable within the priority queue

Definition at line 175 of file heur_setcover.c.

greedycolmu

int* SCIP_HeurData::greedycolmu

value mu for each variable

Definition at line 176 of file heur_setcover.c.

greedycolgamma

SCIP_Real* SCIP_HeurData::greedycolgamma

value gamma for each variable

Definition at line 177 of file heur_setcover.c.

greedycolscore

SCIP_Real* SCIP_HeurData::greedycolscore

score of each variable

Definition at line 178 of file heur_setcover.c.

greedyinst

SCP_INSTANCE SCIP_HeurData::greedyinst

instance that is used to hold covered rows

Definition at line 179 of file heur_setcover.c.

rccols

int* SCIP_HeurData::rccols

stores columns covering some row sorted by increasing costs

Definition at line 182 of file heur_setcover.c.

rccoldelta

SCIP_Real* SCIP_HeurData::rccoldelta

delta values of the columns stored in 'rccols'

Definition at line 183 of file heur_setcover.c.

sglastlb

SCIP_Real* SCIP_HeurData::sglastlb

stores lower bounds of the last iterations

Definition at line 186 of file heur_setcover.c.

nusedpts

int SCIP_HeurData::nusedpts

number of extreme pts per block that will be taken into account

number of extreme pts per block that will be taken into account (-1: all; 0: all which contribute to current relaxation solution)

Definition at line 89 of file heur_xpcrossover.c.

nfailures

unsigned int SCIP_HeurData::nfailures

number of failures since last successful call

Definition at line 90 of file heur_xpcrossover.c.

nextnodenumber

SCIP_Longint SCIP_HeurData::nextnodenumber

number of BnB nodes at which crossover should be called next

Definition at line 91 of file heur_xpcrossover.c.

randomization

SCIP_Bool SCIP_HeurData::randomization

should the choice which sols to take be randomized?

Definition at line 94 of file heur_xpcrossover.c.

hashtable

SCIP_HASHTABLE* SCIP_HeurData::hashtable

hashtable used to store the extreme point tuples already used

Definition at line 99 of file heur_xpcrossover.c.

lasttuple

POINTTUPLE* SCIP_HeurData::lasttuple

last tuple of extreme points

Definition at line 100 of file heur_xpcrossover.c.

equalityrate

SCIP_Real SCIP_HeurData::equalityrate

minimum percentage of coincidence of relaxation and extreme pts

Definition at line 82 of file heur_xprins.c.