Detailed Description

internal methods for storing separated cuts

Author: Tobias Achterberg

Definition in file sepastore.h.

#include "scip/def.h"
#include "blockmemshell/memory.h"
#include "scip/type_implics.h"
#include "scip/type_retcode.h"
#include "scip/type_set.h"
#include "scip/type_stat.h"
#include "scip/type_event.h"
#include "scip/type_lp.h"
#include "scip/type_prob.h"
#include "scip/type_tree.h"
#include "scip/type_reopt.h"
#include "scip/type_sepastore.h"
#include "scip/type_branch.h"

Go to the source code of this file.

Functions
SCIP_RETCODE	SCIPsepastoreCreate (SCIP_SEPASTORE **sepastore)

SCIP_RETCODE	SCIPsepastoreFree (SCIP_SEPASTORE **sepastore)

void	SCIPsepastoreStartInitialLP (SCIP_SEPASTORE *sepastore)

void	SCIPsepastoreEndInitialLP (SCIP_SEPASTORE *sepastore)

void	SCIPsepastoreStartForceCuts (SCIP_SEPASTORE *sepastore)

void	SCIPsepastoreEndForceCuts (SCIP_SEPASTORE *sepastore)

SCIP_RETCODE	SCIPsepastoreAddCut (SCIP_SEPASTORE sepastore, BMS_BLKMEM blkmem, SCIP_SET set, SCIP_STAT stat, SCIP_EVENTQUEUE eventqueue, SCIP_EVENTFILTER eventfilter, SCIP_LP lp, SCIP_SOL sol, SCIP_ROW cut, SCIP_Bool forcecut, SCIP_Bool root, SCIP_Bool infeasible)

SCIP_RETCODE	SCIPsepastoreApplyCuts (SCIP_SEPASTORE sepastore, BMS_BLKMEM blkmem, SCIP_SET set, SCIP_STAT stat, SCIP_PROB transprob, SCIP_PROB origprob, SCIP_TREE tree, SCIP_REOPT reopt, SCIP_LP lp, SCIP_BRANCHCAND branchcand, SCIP_EVENTQUEUE eventqueue, SCIP_EVENTFILTER eventfilter, SCIP_CLIQUETABLE cliquetable, SCIP_Bool root, SCIP_EFFICIACYCHOICE efficiacychoice, SCIP_Bool cutoff)

SCIP_RETCODE	SCIPsepastoreClearCuts (SCIP_SEPASTORE sepastore, BMS_BLKMEM blkmem, SCIP_SET set, SCIP_EVENTQUEUE eventqueue, SCIP_EVENTFILTER eventfilter, SCIP_LP lp)

SCIP_RETCODE	SCIPsepastoreRemoveInefficaciousCuts (SCIP_SEPASTORE sepastore, BMS_BLKMEM blkmem, SCIP_SET set, SCIP_STAT stat, SCIP_EVENTQUEUE eventqueue, SCIP_EVENTFILTER eventfilter, SCIP_LP *lp, SCIP_Bool root, SCIP_EFFICIACYCHOICE efficiacychoice)

SCIP_Bool	SCIPsepastoreIsCutApplicable (SCIP_SET set, SCIP_ROW cut)

SCIP_ROW **	SCIPsepastoreGetCuts (SCIP_SEPASTORE *sepastore)

int	SCIPsepastoreGetNCuts (SCIP_SEPASTORE *sepastore)

int	SCIPsepastoreGetNCutsFound (SCIP_SEPASTORE *sepastore)

int	SCIPsepastoreGetNCutsFoundRound (SCIP_SEPASTORE *sepastore)

int	SCIPsepastoreGetNCutsApplied (SCIP_SEPASTORE *sepastore)

Function Documentation

◆ SCIPsepastoreCreate()

SCIP_RETCODE SCIPsepastoreCreate ( SCIP_SEPASTORE ** sepastore )

creates separation storage

Parameters

sepastore pointer to store separation storage

Definition at line 79 of file sepastore.c.

References BMSallocMemory, FALSE, NULL, SCIP_ALLOC, and SCIP_OKAY.

Referenced by initSolve().

◆ SCIPsepastoreFree()

SCIP_RETCODE SCIPsepastoreFree ( SCIP_SEPASTORE ** sepastore )

frees separation storage

Parameters

sepastore pointer to store separation storage

Definition at line 105 of file sepastore.c.

References BMSfreeMemory, BMSfreeMemoryArrayNull, NULL, and SCIP_OKAY.

Referenced by freeReoptSolve(), and freeSolve().

◆ SCIPsepastoreStartInitialLP()

void SCIPsepastoreStartInitialLP ( SCIP_SEPASTORE * sepastore )

informs separation storage, that the setup of the initial LP starts now

Parameters

sepastore separation storage

Definition at line 124 of file sepastore.c.

References SCIP_SepaStore::initiallp, SCIP_SepaStore::ncuts, NULL, and TRUE.

Referenced by SCIPinitConssLP().

◆ SCIPsepastoreEndInitialLP()

void SCIPsepastoreEndInitialLP ( SCIP_SEPASTORE * sepastore )

informs separation storage, that the setup of the initial LP is now finished

Parameters

sepastore separation storage

Definition at line 136 of file sepastore.c.

References FALSE, SCIP_SepaStore::initiallp, SCIP_SepaStore::ncuts, and NULL.

Referenced by SCIPinitConssLP().

◆ SCIPsepastoreStartForceCuts()

void SCIPsepastoreStartForceCuts ( SCIP_SEPASTORE * sepastore )

informs separation storage, that the following cuts should be used in any case

Parameters

sepastore separation storage

Definition at line 148 of file sepastore.c.

References SCIP_SepaStore::forcecuts, NULL, and TRUE.

Referenced by enforceConstraints().

◆ SCIPsepastoreEndForceCuts()

void SCIPsepastoreEndForceCuts ( SCIP_SEPASTORE * sepastore )

informs separation storage, that the following cuts should no longer be used in any case

Parameters

sepastore separation storage

Definition at line 159 of file sepastore.c.

References FALSE, SCIP_SepaStore::forcecuts, and NULL.

Referenced by enforceConstraints().

◆ SCIPsepastoreAddCut()

SCIP_RETCODE SCIPsepastoreAddCut	(	SCIP_SEPASTORE *	sepastore,
		BMS_BLKMEM *	blkmem,
		SCIP_SET *	set,
		SCIP_STAT *	stat,
		SCIP_EVENTQUEUE *	eventqueue,
		SCIP_EVENTFILTER *	eventfilter,
		SCIP_LP *	lp,
		SCIP_SOL *	sol,
		SCIP_ROW *	cut,
		SCIP_Bool	forcecut,
		SCIP_Bool	root,
		SCIP_Bool *	infeasible
	)

adds cut to separation storage and captures it; if the cut should be forced to enter the LP, an infinite score has to be used

Parameters

sepastore	separation storage
blkmem	block memory
set	global SCIP settings
stat	problem statistics data
eventqueue	event queue
eventfilter	event filter for global events
lp	LP data
sol	primal solution that was separated, or NULL for LP solution
cut	separated cut
forcecut	should the cut be forced to enter the LP?
root	are we at the root node?
infeasible	pointer to store whether the cut is infeasible

Definition at line 406 of file sepastore.c.

References SCIP_SepaStore::cuts, SCIP_SepaStore::cutssize, SCIP_SepaStore::efficacies, SCIP_EventFilter::eventmask, FALSE, SCIP_SepaStore::forcecuts, SCIP_SepaStore::initiallp, SCIP_EventFilter::len, SCIP_SepaStore::ncuts, SCIP_SepaStore::ncutsfound, SCIP_SepaStore::ncutsfoundround, SCIP_SepaStore::nforcedcuts, NULL, SCIP_SepaStore::objparallelisms, SCIP_SepaStore::orthogonalities, SCIP_Bool, SCIP_CALL, SCIP_EVENTTYPE_ROWADDEDSEPA, SCIP_EVENTTYPE_ROWDELETEDSEPA, SCIP_INVALID, SCIP_OKAY, SCIP_Real, SCIPdebugCheckRow, SCIPeventCreateRowAddedSepa(), SCIPeventCreateRowDeletedSepa(), SCIPeventqueueAdd(), SCIProwCapture(), SCIProwChgLocal(), SCIProwGetLhs(), SCIProwGetName(), SCIProwGetNNonz(), SCIProwGetObjParallelism(), SCIProwGetRhs(), SCIProwIsInLP(), SCIProwIsLocal(), SCIProwIsModifiable(), SCIProwRelease(), SCIPsetDebugMsg, SCIPsetGetSepaMaxcuts(), SCIPsetInfinity(), SCIPsetIsInfinity(), SCIP_SepaStore::scores, sepastoreEnsureCutsMem(), sepastoreIsBdchgApplicable(), sepastoreIsCutRedundant(), and sepastoreIsCutRedundantOrInfeasible().

Referenced by SCIPaddCut(), SCIPcutpoolSeparate(), and SCIPreoptApplyCuts().

◆ SCIPsepastoreApplyCuts()

SCIP_RETCODE SCIPsepastoreApplyCuts	(	SCIP_SEPASTORE *	sepastore,
		BMS_BLKMEM *	blkmem,
		SCIP_SET *	set,
		SCIP_STAT *	stat,
		SCIP_PROB *	transprob,
		SCIP_PROB *	origprob,
		SCIP_TREE *	tree,
		SCIP_REOPT *	reopt,
		SCIP_LP *	lp,
		SCIP_BRANCHCAND *	branchcand,
		SCIP_EVENTQUEUE *	eventqueue,
		SCIP_EVENTFILTER *	eventfilter,
		SCIP_CLIQUETABLE *	cliquetable,
		SCIP_Bool	root,
		SCIP_EFFICIACYCHOICE	efficiacychoice,
		SCIP_Bool *	cutoff
	)

adds cuts to the LP and clears separation storage

Parameters

sepastore	separation storage
blkmem	block memory
set	global SCIP settings
stat	problem statistics
transprob	transformed problem
origprob	original problem
tree	branch and bound tree
reopt	reoptimization data structure
lp	LP data
branchcand	branching candidate storage
eventqueue	event queue
eventfilter	global event filter
cliquetable	clique table data structure
root	are we at the root node?
efficiacychoice	type of solution to base efficiacy computation on
cutoff	pointer to store whether an empty domain was created

Definition at line 1088 of file sepastore.c.

References computeScore(), SCIP_SepaStore::cuts, SCIP_SepaStore::efficacies, FALSE, MAX, SCIP_SepaStore::ncuts, SCIP_SepaStore::nforcedcuts, NULL, SCIP_SepaStore::objparallelisms, SCIP_SepaStore::orthogonalities, SCIP_Bool, SCIP_CALL, SCIP_INVALID, SCIP_OKAY, SCIP_Real, SCIPnodeGetDepth(), SCIProwCapture(), SCIProwGetName(), SCIProwGetNNonz(), SCIProwIsModifiable(), SCIProwRelease(), SCIPsepastoreClearCuts(), SCIPsetDebugMsg, SCIPsetGetSepaMaxcuts(), SCIPsetIsFeasPositive(), SCIPsetIsInfinity(), SCIPtreeGetCurrentNode(), SCIP_SepaStore::scores, sepastoreApplyBdchg(), sepastoreApplyCut(), sepastoreDelCut(), sepastoreGetBestCut(), sepastoreIsBdchgApplicable(), and TRUE.

Referenced by applyCuts(), priceAndCutLoop(), SCIPapplyCutsProbing(), and SCIPinitConssLP().

◆ SCIPsepastoreClearCuts()

SCIP_RETCODE SCIPsepastoreClearCuts	(	SCIP_SEPASTORE *	sepastore,
		BMS_BLKMEM *	blkmem,
		SCIP_SET *	set,
		SCIP_EVENTQUEUE *	eventqueue,
		SCIP_EVENTFILTER *	eventfilter,
		SCIP_LP *	lp
	)

clears the separation storage without adding the cuts to the LP

Parameters

sepastore	separation storage
blkmem	block memory
set	global SCIP settings
eventqueue	event queue
eventfilter	event filter for global events
lp	LP data

Definition at line 1220 of file sepastore.c.

References BMSfreeMemoryArrayNull, SCIP_SepaStore::cuts, SCIP_SepaStore::cutssize, SCIP_EventFilter::eventmask, SCIP_SepaStore::initiallp, SCIP_EventFilter::len, SCIP_SepaStore::ncuts, SCIP_SepaStore::ncutsfoundround, SCIP_SepaStore::nforcedcuts, NULL, SCIP_CALL, SCIP_EVENTTYPE_ROWDELETEDSEPA, SCIP_OKAY, SCIPeventCreateRowDeletedSepa(), SCIPeventqueueAdd(), SCIProwRelease(), and SCIPsetDebugMsg.

Referenced by applyCuts(), priceAndCutLoop(), SCIPclearCuts(), SCIPinitConssLP(), and SCIPsepastoreApplyCuts().

◆ SCIPsepastoreRemoveInefficaciousCuts()

SCIP_RETCODE SCIPsepastoreRemoveInefficaciousCuts	(	SCIP_SEPASTORE *	sepastore,
		BMS_BLKMEM *	blkmem,
		SCIP_SET *	set,
		SCIP_STAT *	stat,
		SCIP_EVENTQUEUE *	eventqueue,
		SCIP_EVENTFILTER *	eventfilter,
		SCIP_LP *	lp,
		SCIP_Bool	root,
		SCIP_EFFICIACYCHOICE	efficiacychoice
	)

removes cuts that are inefficacious w.r.t. the current LP solution from separation storage without adding the cuts to the LP

Parameters

sepastore	separation storage
blkmem	block memory
set	global SCIP settings
stat	problem statistics data
eventqueue	event queue
eventfilter	event filter for global events
lp	LP data
root	are we at the root node?
efficiacychoice	type of solution to base efficiacy computation on