scippp::params::REOPTIMIZATION Namespace Reference

Parameters with prefix reoptimization. More...

Namespaces
namespace	GLOBALCONS
	Parameters with prefix reoptimization/globalcons.

Variables
constexpr Param< bool >	COMMONTIMELIMIT { "reoptimization/commontimelimit" }
	time limit over all reoptimization rounds?.
constexpr Param< double >	DELAY { "reoptimization/delay" }
	minimum similarity for using reoptimization of the search tree.
constexpr Param< bool >	ENABLE { "reoptimization/enable" }
	should reoptimization used?
constexpr Param< int >	FORCEHEURRESTART { "reoptimization/forceheurrestart" }
	force a restart if the last n optimal solutions were found by heuristic reoptsols
constexpr Param< int >	MAXCUTAGE { "reoptimization/maxcutage" }
	maximal age of a cut to be use for reoptimization
constexpr Param< int >	MAXDIFFOFNODES { "reoptimization/maxdiffofnodes" }
	maximal number of bound changes between two stored nodes on one path
constexpr Param< int >	MAXSAVEDNODES { "reoptimization/maxsavednodes" }
	maximal number of saved nodes
constexpr Param< double >	OBJSIMROOTLP { "reoptimization/objsimrootLP" }
	similarity of two sequential objective function to disable solving the root LP.
constexpr Param< double >	OBJSIMSOL { "reoptimization/objsimsol" }
	similarity of two objective functions to re-use stored solutions
constexpr Param< bool >	REDUCETOFRONTIER { "reoptimization/reducetofrontier" }
	delete stored nodes which were not reoptimized
constexpr Param< bool >	SAVECONSPROP { "reoptimization/saveconsprop" }
	save constraint and propagator propagations
constexpr Param< int >	SAVESOLS { "reoptimization/savesols" }
	number of best solutions which should be saved for the following runs. (-1: save all)
constexpr Param< bool >	SEPABESTSOL { "reoptimization/sepabestsol" }
	separate the optimal solution, i.e., for constrained shortest path
constexpr Param< bool >	SHRINKINNER { "reoptimization/shrinkinner" }
	replace branched inner nodes by their child nodes, if the number of bound changes is not to large
constexpr Param< int >	SOLVELP { "reoptimization/solvelp" }
	at which reopttype should the LP be solved? (1: transit, 3: strong branched, 4: w/ added logicor, 5: only leafs).
constexpr Param< int >	SOLVELPDIFF { "reoptimization/solvelpdiff" }
	maximal number of bound changes at node to skip solving the LP
constexpr Param< bool >	STOREVARHISTORY { "reoptimization/storevarhistory" }
	use variable history of the previous solve if the objctive function has changed only slightly
constexpr Param< bool >	STRONGBRANCHINGINIT { "reoptimization/strongbranchinginit" }
	try to fix variables at the root node before reoptimizing by probing like strong branching
constexpr Param< bool >	USECUTS { "reoptimization/usecuts" }
	reoptimize cuts found at the root node
constexpr Param< bool >	USEPSCOST { "reoptimization/usepscost" }
	re-use pseudo costs if the objective function changed only slightly
constexpr Param< bool >	USESPLITCONS { "reoptimization/usesplitcons" }
	use constraints to reconstruct the subtree pruned be dual reduction when reactivating the node
constexpr Param< char >	VARORDERINTERDICTION { "reoptimization/varorderinterdiction" }
	use 'd'efault, 'r'andom or a variable ordering based on 'i'nference score for interdiction branching used during reoptimization

Detailed Description

Parameters with prefix reoptimization.

Variable Documentation

COMMONTIMELIMIT

Param<bool> scippp::params::REOPTIMIZATION::COMMONTIMELIMIT { "reoptimization/commontimelimit" }

constexpr

time limit over all reoptimization rounds?.

Definition at line 5934 of file parameters.hpp.

DELAY

Param<double> scippp::params::REOPTIMIZATION::DELAY { "reoptimization/delay" }

constexpr

minimum similarity for using reoptimization of the search tree.

Definition at line 5932 of file parameters.hpp.

ENABLE

Param<bool> scippp::params::REOPTIMIZATION::ENABLE { "reoptimization/enable" }

constexpr

should reoptimization used?

Definition at line 5909 of file parameters.hpp.

FORCEHEURRESTART

Param<int> scippp::params::REOPTIMIZATION::FORCEHEURRESTART { "reoptimization/forceheurrestart" }

constexpr

force a restart if the last n optimal solutions were found by heuristic reoptsols

Definition at line 5942 of file parameters.hpp.

MAXCUTAGE

Param<int> scippp::params::REOPTIMIZATION::MAXCUTAGE { "reoptimization/maxcutage" }

constexpr

maximal age of a cut to be use for reoptimization

Definition at line 5953 of file parameters.hpp.

MAXDIFFOFNODES

Param<int> scippp::params::REOPTIMIZATION::MAXDIFFOFNODES { "reoptimization/maxdiffofnodes" }

constexpr

maximal number of bound changes between two stored nodes on one path

Definition at line 5913 of file parameters.hpp.

MAXSAVEDNODES

Param<int> scippp::params::REOPTIMIZATION::MAXSAVEDNODES { "reoptimization/maxsavednodes" }

constexpr

maximal number of saved nodes

Definition at line 5911 of file parameters.hpp.

OBJSIMROOTLP

Param<double> scippp::params::REOPTIMIZATION::OBJSIMROOTLP { "reoptimization/objsimrootLP" }

constexpr

similarity of two sequential objective function to disable solving the root LP.

Definition at line 5928 of file parameters.hpp.

OBJSIMSOL

Param<double> scippp::params::REOPTIMIZATION::OBJSIMSOL { "reoptimization/objsimsol" }

constexpr

similarity of two objective functions to re-use stored solutions

Definition at line 5930 of file parameters.hpp.

REDUCETOFRONTIER

Param<bool> scippp::params::REOPTIMIZATION::REDUCETOFRONTIER { "reoptimization/reducetofrontier" }

constexpr

delete stored nodes which were not reoptimized

Definition at line 5940 of file parameters.hpp.

SAVECONSPROP

Param<bool> scippp::params::REOPTIMIZATION::SAVECONSPROP { "reoptimization/saveconsprop" }

constexpr

save constraint and propagator propagations

Definition at line 5944 of file parameters.hpp.

SAVESOLS

Param<int> scippp::params::REOPTIMIZATION::SAVESOLS { "reoptimization/savesols" }

constexpr

number of best solutions which should be saved for the following runs. (-1: save all)

Definition at line 5926 of file parameters.hpp.

SEPABESTSOL

Param<bool> scippp::params::REOPTIMIZATION::SEPABESTSOL { "reoptimization/sepabestsol" }

constexpr

separate the optimal solution, i.e., for constrained shortest path

Definition at line 5915 of file parameters.hpp.

SHRINKINNER

Param<bool> scippp::params::REOPTIMIZATION::SHRINKINNER { "reoptimization/shrinkinner" }

constexpr

replace branched inner nodes by their child nodes, if the number of bound changes is not to large

Definition at line 5936 of file parameters.hpp.

SOLVELP

Param<int> scippp::params::REOPTIMIZATION::SOLVELP { "reoptimization/solvelp" }

constexpr

at which reopttype should the LP be solved? (1: transit, 3: strong branched, 4: w/ added logicor, 5: only leafs).

Definition at line 5922 of file parameters.hpp.

SOLVELPDIFF

Param<int> scippp::params::REOPTIMIZATION::SOLVELPDIFF { "reoptimization/solvelpdiff" }

constexpr

maximal number of bound changes at node to skip solving the LP

Definition at line 5924 of file parameters.hpp.

STOREVARHISTORY

Param<bool> scippp::params::REOPTIMIZATION::STOREVARHISTORY { "reoptimization/storevarhistory" }

constexpr

use variable history of the previous solve if the objctive function has changed only slightly

Definition at line 5917 of file parameters.hpp.

STRONGBRANCHINGINIT

Param<bool> scippp::params::REOPTIMIZATION::STRONGBRANCHINGINIT { "reoptimization/strongbranchinginit" }

constexpr

try to fix variables at the root node before reoptimizing by probing like strong branching

Definition at line 5938 of file parameters.hpp.

USECUTS

Param<bool> scippp::params::REOPTIMIZATION::USECUTS { "reoptimization/usecuts" }

constexpr

reoptimize cuts found at the root node

Definition at line 5951 of file parameters.hpp.

USEPSCOST

Param<bool> scippp::params::REOPTIMIZATION::USEPSCOST { "reoptimization/usepscost" }

constexpr

re-use pseudo costs if the objective function changed only slightly

Definition at line 5919 of file parameters.hpp.

USESPLITCONS

Param<bool> scippp::params::REOPTIMIZATION::USESPLITCONS { "reoptimization/usesplitcons" }

constexpr

use constraints to reconstruct the subtree pruned be dual reduction when reactivating the node

Definition at line 5946 of file parameters.hpp.

VARORDERINTERDICTION

Param<char> scippp::params::REOPTIMIZATION::VARORDERINTERDICTION { "reoptimization/varorderinterdiction" }

constexpr

use 'd'efault, 'r'andom or a variable ordering based on 'i'nference score for interdiction branching used during reoptimization

Definition at line 5949 of file parameters.hpp.