Parameters with prefix benders/default. More...
Variables | |
constexpr Param< bool > | AUXVARSIMPLINT { "benders/default/auxvarsimplint" } |
if the subproblem objective is integer, then define the auxiliary variables as implicit integers? | |
constexpr Param< bool > | CHECKCONSCONVEXITY { "benders/default/checkconsconvexity" } |
should the constraints of the subproblems be checked for convexity? | |
constexpr Param< double > | COREPOINTPERTURB { "benders/default/corepointperturb" } |
the constant use to perturb the cut strengthening core point | |
constexpr Param< bool > | CUTCHECK { "benders/default/cutcheck" } |
should Benders' cuts be generated while checking solutions? | |
constexpr Param< bool > | CUTLP { "benders/default/cutlp" } |
should Benders' cuts be generated for LP solutions? | |
constexpr Param< bool > | CUTPSEUDO { "benders/default/cutpseudo" } |
should Benders' cuts be generated for pseudo solutions? | |
constexpr Param< bool > | CUTRELAX { "benders/default/cutrelax" } |
should Benders' cuts be generated for relaxation solutions? | |
constexpr Param< bool > | CUTSASCONSS { "benders/default/cutsasconss" } |
should the transferred cuts be added as constraints? | |
constexpr Param< bool > | CUTSTRENGTHENENABLED { "benders/default/cutstrengthenenabled" } |
should the core point cut strengthening be employed (only applied to fractional solutions or continuous subproblems)? | |
constexpr Param< char > | CUTSTRENGTHENINTPOINT { "benders/default/cutstrengthenintpoint" } |
where should the strengthening interior point be sourced from ('l'p relaxation, 'f'irst solution, 'i'ncumbent solution, 'r'elative interior point, vector of 'o'nes, vector of 'z'eros) | |
constexpr Param< double > | CUTSTRENGTHENMULT { "benders/default/cutstrengthenmult" } |
the convex combination multiplier for the cut strengthening | |
constexpr Param< bool > | EXECFEASPHASE { "benders/default/execfeasphase" } |
should a feasibility phase be executed during the root node, i.e. | |
constexpr Param< bool > | LNSCHECK { "benders/default/lnscheck" } |
should Benders' decomposition be used in LNS heurisics? | |
constexpr Param< int > | LNSMAXCALLS { "benders/default/lnsmaxcalls" } |
the maximum number of Benders' decomposition calls in LNS heuristics (-1: no limit) | |
constexpr Param< int > | LNSMAXCALLSROOT { "benders/default/lnsmaxcallsroot" } |
the maximum number of root node Benders' decomposition calls in LNS heuristics (-1: no limit) | |
constexpr Param< int > | LNSMAXDEPTH { "benders/default/lnsmaxdepth" } |
maximum depth at which the LNS check is performed (-1: no limit) | |
constexpr Param< double > | MAXSLACKVARCOEF { "benders/default/maxslackvarcoef" } |
the maximal objective coefficient of the slack variables in the subproblem | |
constexpr Param< int > | NLPITERLIMIT { "benders/default/nlpiterlimit" } |
iteration limit for NLP solver | |
constexpr Param< int > | NOIMPROVELIMIT { "benders/default/noimprovelimit" } |
the maximum number of cut strengthening without improvement | |
constexpr Param< int > | NUMTHREADS { "benders/default/numthreads" } |
the number of threads to use when solving the subproblems | |
constexpr Param< int > | PRIORITY { "benders/default/priority" } |
priority of Benders' decomposition <default> | |
constexpr Param< double > | SLACKVARCOEF { "benders/default/slackvarcoef" } |
the initial objective coefficient of the slack variables in the subproblem | |
constexpr Param< double > | SUBPROBFRAC { "benders/default/subprobfrac" } |
fraction of subproblems that are solved in each iteration | |
constexpr Param< bool > | TRANSFERCUTS { "benders/default/transfercuts" } |
should Benders' cuts from LNS heuristics be transferred to the main SCIP instance? | |
constexpr Param< bool > | UPDATEAUXVARBOUND { "benders/default/updateauxvarbound" } |
should the auxiliary variable bound be updated by solving the subproblem? | |
Parameters with prefix benders/default.
|
constexpr |
if the subproblem objective is integer, then define the auxiliary variables as implicit integers?
Definition at line 51 of file parameters.hpp.
|
constexpr |
should the constraints of the subproblems be checked for convexity?
Definition at line 76 of file parameters.hpp.
|
constexpr |
the constant use to perturb the cut strengthening core point
Definition at line 59 of file parameters.hpp.
|
constexpr |
should Benders' cuts be generated while checking solutions?
Definition at line 53 of file parameters.hpp.
|
constexpr |
should Benders' cuts be generated for LP solutions?
Definition at line 29 of file parameters.hpp.
|
constexpr |
should Benders' cuts be generated for pseudo solutions?
Definition at line 31 of file parameters.hpp.
|
constexpr |
should Benders' cuts be generated for relaxation solutions?
Definition at line 33 of file parameters.hpp.
|
constexpr |
should the transferred cuts be added as constraints?
Definition at line 45 of file parameters.hpp.
|
constexpr |
should the core point cut strengthening be employed (only applied to fractional solutions or continuous subproblems)?
Definition at line 62 of file parameters.hpp.
|
constexpr |
where should the strengthening interior point be sourced from ('l'p relaxation, 'f'irst solution, 'i'ncumbent solution, 'r'elative interior point, vector of 'o'nes, vector of 'z'eros)
Definition at line 65 of file parameters.hpp.
|
constexpr |
the convex combination multiplier for the cut strengthening
Definition at line 55 of file parameters.hpp.
|
constexpr |
should a feasibility phase be executed during the root node, i.e.
adding slack variables to constraints to ensure feasibility
Definition at line 70 of file parameters.hpp.
|
constexpr |
should Benders' decomposition be used in LNS heurisics?
Definition at line 37 of file parameters.hpp.
|
constexpr |
the maximum number of Benders' decomposition calls in LNS heuristics (-1: no limit)
Definition at line 41 of file parameters.hpp.
|
constexpr |
the maximum number of root node Benders' decomposition calls in LNS heuristics (-1: no limit)
Definition at line 43 of file parameters.hpp.
|
constexpr |
maximum depth at which the LNS check is performed (-1: no limit)
Definition at line 39 of file parameters.hpp.
|
constexpr |
the maximal objective coefficient of the slack variables in the subproblem
Definition at line 74 of file parameters.hpp.
|
constexpr |
iteration limit for NLP solver
Definition at line 78 of file parameters.hpp.
|
constexpr |
the maximum number of cut strengthening without improvement
Definition at line 57 of file parameters.hpp.
|
constexpr |
the number of threads to use when solving the subproblems
Definition at line 67 of file parameters.hpp.
|
constexpr |
priority of Benders' decomposition <default>
Definition at line 27 of file parameters.hpp.
|
constexpr |
the initial objective coefficient of the slack variables in the subproblem
Definition at line 72 of file parameters.hpp.
|
constexpr |
fraction of subproblems that are solved in each iteration
Definition at line 47 of file parameters.hpp.
|
constexpr |
should Benders' cuts from LNS heuristics be transferred to the main SCIP instance?
Definition at line 35 of file parameters.hpp.
|
constexpr |
should the auxiliary variable bound be updated by solving the subproblem?
Definition at line 49 of file parameters.hpp.