Parameters with prefix separating/cgmip. More...
Variables | |
constexpr Param< bool > | ADDVIOLATIONCONS { "separating/cgmip/addviolationcons" } |
add constraint to subscip that only allows violated cuts (otherwise add obj. limit)? | |
constexpr Param< bool > | ADDVIOLCONSHDLR { "separating/cgmip/addviolconshdlr" } |
add constraint handler to filter out violated cuts? | |
constexpr Param< bool > | CMIROWNBOUNDS { "separating/cgmip/cmirownbounds" } |
tell CMIR-generator which bounds to used in rounding? | |
constexpr Param< bool > | CONSHDLRUSENORM { "separating/cgmip/conshdlrusenorm" } |
should the violation constraint handler use the norm of a cut to check for feasibility? | |
constexpr Param< bool > | CONTCONVERT { "separating/cgmip/contconvert" } |
Convert some integral variables to be continuous to reduce the size of the sub-MIP? | |
constexpr Param< double > | CONTCONVFRAC { "separating/cgmip/contconvfrac" } |
fraction of integral variables converted to be continuous (if contconvert) | |
constexpr Param< int > | CONTCONVMIN { "separating/cgmip/contconvmin" } |
minimum number of integral variables before some are converted to be continuous | |
constexpr Param< double > | CUTCOEFBND { "separating/cgmip/cutcoefbnd" } |
bounds on the values of the coefficients in the CG-cut | |
constexpr Param< bool > | DECISIONTREE { "separating/cgmip/decisiontree" } |
Use decision tree to turn separation on/off? | |
constexpr Param< bool > | DELAY { "separating/cgmip/delay" } |
should separator be delayed, if other separators found cuts? | |
constexpr Param< bool > | DYNAMICCUTS { "separating/cgmip/dynamiccuts" } |
should generated cuts be removed from the LP if they are no longer tight? | |
constexpr Param< bool > | EARLYTERM { "separating/cgmip/earlyterm" } |
terminate separation if a violated (but possibly sub-optimal) cut has been found? | |
constexpr Param< int > | EXPBACKOFF { "separating/cgmip/expbackoff" } |
base for exponential increase of frequency at which separator <cgmip> is called (1: call at each multiple of frequency) | |
constexpr Param< int > | FREQ { "separating/cgmip/freq" } |
frequency for calling separator <cgmip> (-1: never, 0: only in root node) | |
constexpr Param< bool > | GENPRIMALSOLS { "separating/cgmip/genprimalsols" } |
Try to generate primal solutions from Gomory cuts? | |
constexpr Param< bool > | INTCONVERT { "separating/cgmip/intconvert" } |
Convert some integral variables attaining fractional values to have integral value? | |
constexpr Param< double > | INTCONVFRAC { "separating/cgmip/intconvfrac" } |
fraction of frac. integral variables converted to have integral value (if intconvert) | |
constexpr Param< int > | INTCONVMIN { "separating/cgmip/intconvmin" } |
minimum number of integral variables before some are converted to have integral value | |
constexpr Param< double > | MAXBOUNDDIST { "separating/cgmip/maxbounddist" } |
maximal relative distance from current node's dual bound to primal bound compared to best node's dual bound for applying separator <cgmip> (0.0: only on current best node, 1.0: on all nodes) | |
constexpr Param< int > | MAXDEPTH { "separating/cgmip/maxdepth" } |
maximal depth at which the separator is applied (-1: unlimited) | |
constexpr Param< long long > | MAXNODELIMIT { "separating/cgmip/maxnodelimit" } |
maximum number of nodes considered for sub-MIP (-1: unlimited) | |
constexpr Param< int > | MAXROUNDS { "separating/cgmip/maxrounds" } |
maximal number of cgmip separation rounds per node (-1: unlimited) | |
constexpr Param< int > | MAXROUNDSROOT { "separating/cgmip/maxroundsroot" } |
maximal number of cgmip separation rounds in the root node (-1: unlimited) | |
constexpr Param< int > | MAXROWAGE { "separating/cgmip/maxrowage" } |
maximal age of rows to consider if onlyactiverows is false | |
constexpr Param< double > | MEMORYLIMIT { "separating/cgmip/memorylimit" } |
memory limit for sub-MIP | |
constexpr Param< long long > | MINNODELIMIT { "separating/cgmip/minnodelimit" } |
minimum number of nodes considered for sub-MIP (-1: unlimited) | |
constexpr Param< bool > | OBJLONE { "separating/cgmip/objlone" } |
Should the objective of the sub-MIP minimize the l1-norm of the multipliers? | |
constexpr Param< double > | OBJWEIGHT { "separating/cgmip/objweight" } |
weight used for the row combination coefficient in the sub-MIP objective | |
constexpr Param< bool > | OBJWEIGHTSIZE { "separating/cgmip/objweightsize" } |
Weight each row by its size? | |
constexpr Param< bool > | ONLYACTIVEROWS { "separating/cgmip/onlyactiverows" } |
Use only active rows to generate cuts? | |
constexpr Param< bool > | ONLYINTVARS { "separating/cgmip/onlyintvars" } |
Generate cuts for problems with only integer variables? | |
constexpr Param< bool > | ONLYRANKONE { "separating/cgmip/onlyrankone" } |
Separate only rank 1 inequalities w.r.t. CG-MIP separator? | |
constexpr Param< bool > | OUTPUT { "separating/cgmip/output" } |
Should information about the sub-MIP and cuts be displayed? | |
constexpr Param< bool > | PRIMALSEPARATION { "separating/cgmip/primalseparation" } |
only separate cuts that are tight for the best feasible solution? | |
constexpr Param< int > | PRIORITY { "separating/cgmip/priority" } |
priority of separator <cgmip> | |
constexpr Param< bool > | SKIPMULTBOUNDS { "separating/cgmip/skipmultbounds" } |
Skip the upper bounds on the multipliers in the sub-MIP? | |
constexpr Param< bool > | SUBSCIPFAST { "separating/cgmip/subscipfast" } |
Should the settings for the sub-MIP be optimized for speed? | |
constexpr Param< double > | TIMELIMIT { "separating/cgmip/timelimit" } |
time limit for sub-MIP | |
constexpr Param< bool > | USECMIR { "separating/cgmip/usecmir" } |
use CMIR-generator (otherwise add cut directly)? | |
constexpr Param< bool > | USECUTPOOL { "separating/cgmip/usecutpool" } |
use cutpool to store CG-cuts even if the are not efficient? | |
constexpr Param< bool > | USEOBJLB { "separating/cgmip/useobjlb" } |
Use lower bound on objective function (via primal solution)? | |
constexpr Param< bool > | USEOBJUB { "separating/cgmip/useobjub" } |
Use upper bound on objective function (via primal solution)? | |
constexpr Param< bool > | USESTRONGCG { "separating/cgmip/usestrongcg" } |
use strong CG-function to strengthen cut? | |
Parameters with prefix separating/cgmip.
|
constexpr |
add constraint to subscip that only allows violated cuts (otherwise add obj. limit)?
Definition at line 5711 of file parameters.hpp.
|
constexpr |
add constraint handler to filter out violated cuts?
Definition at line 5713 of file parameters.hpp.
|
constexpr |
tell CMIR-generator which bounds to used in rounding?
Definition at line 5703 of file parameters.hpp.
|
constexpr |
should the violation constraint handler use the norm of a cut to check for feasibility?
Definition at line 5715 of file parameters.hpp.
|
constexpr |
Convert some integral variables to be continuous to reduce the size of the sub-MIP?
Definition at line 5677 of file parameters.hpp.
|
constexpr |
fraction of integral variables converted to be continuous (if contconvert)
Definition at line 5679 of file parameters.hpp.
|
constexpr |
minimum number of integral variables before some are converted to be continuous
Definition at line 5681 of file parameters.hpp.
|
constexpr |
bounds on the values of the coefficients in the CG-cut
Definition at line 5667 of file parameters.hpp.
|
constexpr |
Use decision tree to turn separation on/off?
Definition at line 5657 of file parameters.hpp.
|
constexpr |
should separator be delayed, if other separators found cuts?
Definition at line 5646 of file parameters.hpp.
|
constexpr |
should generated cuts be removed from the LP if they are no longer tight?
Definition at line 5697 of file parameters.hpp.
|
constexpr |
terminate separation if a violated (but possibly sub-optimal) cut has been found?
Definition at line 5709 of file parameters.hpp.
|
constexpr |
base for exponential increase of frequency at which separator <cgmip> is called (1: call at each multiple of frequency)
Definition at line 5649 of file parameters.hpp.
|
constexpr |
frequency for calling separator <cgmip> (-1: never, 0: only in root node)
Definition at line 5641 of file parameters.hpp.
|
constexpr |
Try to generate primal solutions from Gomory cuts?
Definition at line 5725 of file parameters.hpp.
|
constexpr |
Convert some integral variables attaining fractional values to have integral value?
Definition at line 5683 of file parameters.hpp.
|
constexpr |
fraction of frac. integral variables converted to have integral value (if intconvert)
Definition at line 5685 of file parameters.hpp.
|
constexpr |
minimum number of integral variables before some are converted to have integral value
Definition at line 5687 of file parameters.hpp.
|
constexpr |
maximal relative distance from current node's dual bound to primal bound compared to best node's dual bound for applying separator <cgmip> (0.0: only on current best node, 1.0: on all nodes)
Definition at line 5644 of file parameters.hpp.
|
constexpr |
maximal depth at which the separator is applied (-1: unlimited)
Definition at line 5655 of file parameters.hpp.
|
constexpr |
maximum number of nodes considered for sub-MIP (-1: unlimited)
Definition at line 5665 of file parameters.hpp.
|
constexpr |
maximal number of cgmip separation rounds per node (-1: unlimited)
Definition at line 5651 of file parameters.hpp.
|
constexpr |
maximal number of cgmip separation rounds in the root node (-1: unlimited)
Definition at line 5653 of file parameters.hpp.
|
constexpr |
maximal age of rows to consider if onlyactiverows is false
Definition at line 5671 of file parameters.hpp.
|
constexpr |
memory limit for sub-MIP
Definition at line 5661 of file parameters.hpp.
|
constexpr |
minimum number of nodes considered for sub-MIP (-1: unlimited)
Definition at line 5663 of file parameters.hpp.
|
constexpr |
Should the objective of the sub-MIP minimize the l1-norm of the multipliers?
Definition at line 5691 of file parameters.hpp.
|
constexpr |
weight used for the row combination coefficient in the sub-MIP objective
Definition at line 5693 of file parameters.hpp.
|
constexpr |
Weight each row by its size?
Definition at line 5695 of file parameters.hpp.
|
constexpr |
Use only active rows to generate cuts?
Definition at line 5669 of file parameters.hpp.
|
constexpr |
Generate cuts for problems with only integer variables?
Definition at line 5675 of file parameters.hpp.
|
constexpr |
Separate only rank 1 inequalities w.r.t. CG-MIP separator?
Definition at line 5673 of file parameters.hpp.
|
constexpr |
Should information about the sub-MIP and cuts be displayed?
Definition at line 5723 of file parameters.hpp.
|
constexpr |
only separate cuts that are tight for the best feasible solution?
Definition at line 5707 of file parameters.hpp.
|
constexpr |
priority of separator <cgmip>
Definition at line 5639 of file parameters.hpp.
|
constexpr |
Skip the upper bounds on the multipliers in the sub-MIP?
Definition at line 5689 of file parameters.hpp.
|
constexpr |
Should the settings for the sub-MIP be optimized for speed?
Definition at line 5721 of file parameters.hpp.
|
constexpr |
time limit for sub-MIP
Definition at line 5659 of file parameters.hpp.
|
constexpr |
use CMIR-generator (otherwise add cut directly)?
Definition at line 5699 of file parameters.hpp.
|
constexpr |
use cutpool to store CG-cuts even if the are not efficient?
Definition at line 5705 of file parameters.hpp.
|
constexpr |
Use lower bound on objective function (via primal solution)?
Definition at line 5719 of file parameters.hpp.
|
constexpr |
Use upper bound on objective function (via primal solution)?
Definition at line 5717 of file parameters.hpp.
|
constexpr |
use strong CG-function to strengthen cut?
Definition at line 5701 of file parameters.hpp.