Parameters with prefix separating/oddcycle. More...
Variables | |
constexpr Param< bool > | ADDSELFARCS { "separating/oddcycle/addselfarcs" } |
add links between a variable and its negated | |
constexpr Param< bool > | ALLOWMULTIPLECUTS { "separating/oddcycle/allowmultiplecuts" } |
Even if a variable is already covered by a cut, still allow another cut to cover it too? | |
constexpr Param< int > | CUTTHRESHOLD { "separating/oddcycle/cutthreshold" } |
maximal number of other cuts s.t. separation is applied (-1 for direct call) | |
constexpr Param< bool > | DELAY { "separating/oddcycle/delay" } |
should separator be delayed, if other separators found cuts? | |
constexpr Param< int > | EXPBACKOFF { "separating/oddcycle/expbackoff" } |
base for exponential increase of frequency at which separator <oddcycle> is called (1: call at each multiple of frequency) | |
constexpr Param< int > | FREQ { "separating/oddcycle/freq" } |
frequency for calling separator <oddcycle> (-1: never, 0: only in root node) | |
constexpr Param< bool > | INCLUDETRIANGLES { "separating/oddcycle/includetriangles" } |
separate triangles found as 3-cycles or repaired larger cycles | |
constexpr Param< bool > | LIFTODDCYCLES { "separating/oddcycle/liftoddcycles" } |
Should odd cycle cuts be lifted? | |
constexpr Param< bool > | LPLIFTCOEF { "separating/oddcycle/lpliftcoef" } |
Choose lifting candidate by coef*lpvalue or only by coef? | |
constexpr Param< double > | MAXBOUNDDIST { "separating/oddcycle/maxbounddist" } |
maximal relative distance from current node's dual bound to primal bound compared to best node's dual bound for applying separator <oddcycle> (0.0: only on current best node, 1.0: on all nodes) | |
constexpr Param< int > | MAXCUTSLEVEL { "separating/oddcycle/maxcutslevel" } |
maximal number of oddcycle cuts generated in every level of the level graph | |
constexpr Param< int > | MAXCUTSROOT { "separating/oddcycle/maxcutsroot" } |
maximal number of oddcycle cuts generated per chosen variable as root of the level graph | |
constexpr Param< int > | MAXNLEVELS { "separating/oddcycle/maxnlevels" } |
maximal number of levels in level graph | |
constexpr Param< int > | MAXPERNODESLEVEL { "separating/oddcycle/maxpernodeslevel" } |
percentage of nodes allowed in the same level of the level graph [0-100] | |
constexpr Param< int > | MAXREFERENCE { "separating/oddcycle/maxreference" } |
minimal weight on an edge (in level graph or bipartite graph) | |
constexpr Param< int > | MAXROUNDS { "separating/oddcycle/maxrounds" } |
maximal number of oddcycle separation rounds per node (-1: unlimited) | |
constexpr Param< int > | MAXROUNDSROOT { "separating/oddcycle/maxroundsroot" } |
maximal number of oddcycle separation rounds in the root node (-1: unlimited) | |
constexpr Param< int > | MAXSEPACUTS { "separating/oddcycle/maxsepacuts" } |
maximal number of oddcycle cuts separated per separation round | |
constexpr Param< int > | MAXSEPACUTSROOT { "separating/oddcycle/maxsepacutsroot" } |
maximal number of oddcycle cuts separated per separation round in the root node | |
constexpr Param< int > | MAXUNSUCESSFULL { "separating/oddcycle/maxunsucessfull" } |
number of unsuccessful calls at current node | |
constexpr Param< bool > | MULTIPLECUTS { "separating/oddcycle/multiplecuts" } |
Even if a variable is already covered by a cut, still try it as start node for a cycle search? | |
constexpr Param< int > | OFFSETNODESLEVEL { "separating/oddcycle/offsetnodeslevel" } |
offset of nodes allowed in the same level of the level graph (additional to the percentage of levelnodes) | |
constexpr Param< int > | OFFSETTESTVARS { "separating/oddcycle/offsettestvars" } |
offset of variables to try the chosen method on (additional to the percentage of testvars) | |
constexpr Param< int > | PERCENTTESTVARS { "separating/oddcycle/percenttestvars" } |
percentage of variables to try the chosen method on [0-100] | |
constexpr Param< int > | PRIORITY { "separating/oddcycle/priority" } |
priority of separator <oddcycle> | |
constexpr Param< bool > | RECALCLIFTCOEF { "separating/oddcycle/recalcliftcoef" } |
Calculate lifting coefficient of every candidate in every step (or only if its chosen)? | |
constexpr Param< bool > | REPAIRCYCLES { "separating/oddcycle/repaircycles" } |
try to repair violated cycles with double appearance of a variable | |
constexpr Param< int > | SCALINGFACTOR { "separating/oddcycle/scalingfactor" } |
factor for scaling of the arc-weights | |
constexpr Param< bool > | SORTROOTNEIGHBORS { "separating/oddcycle/sortrootneighbors" } |
sort level of the root neighbors by fractionality (maxfrac) | |
constexpr Param< int > | SORTSWITCH { "separating/oddcycle/sortswitch" } |
use sorted variable array (unsorted(0), maxlp(1), minlp(2), maxfrac(3), minfrac(4)) | |
constexpr Param< bool > | USEGLS { "separating/oddcycle/usegls" } |
Should the search method by Groetschel, Lovasz, Schrijver be used? Otherwise use levelgraph method by Hoffman, Padberg. | |
Parameters with prefix separating/oddcycle.
|
constexpr |
add links between a variable and its negated
Definition at line 6185 of file parameters.hpp.
|
constexpr |
Even if a variable is already covered by a cut, still allow another cut to cover it too?
Definition at line 6193 of file parameters.hpp.
|
constexpr |
maximal number of other cuts s.t. separation is applied (-1 for direct call)
Definition at line 6221 of file parameters.hpp.
|
constexpr |
should separator be delayed, if other separators found cuts?
Definition at line 6165 of file parameters.hpp.
|
constexpr |
base for exponential increase of frequency at which separator <oddcycle> is called (1: call at each multiple of frequency)
Definition at line 6168 of file parameters.hpp.
|
constexpr |
frequency for calling separator <oddcycle> (-1: never, 0: only in root node)
Definition at line 6160 of file parameters.hpp.
|
constexpr |
separate triangles found as 3-cycles or repaired larger cycles
Definition at line 6189 of file parameters.hpp.
|
constexpr |
Should odd cycle cuts be lifted?
Definition at line 6173 of file parameters.hpp.
|
constexpr |
Choose lifting candidate by coef*lpvalue or only by coef?
Definition at line 6195 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 <oddcycle> (0.0: only on current best node, 1.0: on all nodes)
Definition at line 6163 of file parameters.hpp.
|
constexpr |
maximal number of oddcycle cuts generated in every level of the level graph
Definition at line 6215 of file parameters.hpp.
|
constexpr |
maximal number of oddcycle cuts generated per chosen variable as root of the level graph
Definition at line 6213 of file parameters.hpp.
|
constexpr |
maximal number of levels in level graph
Definition at line 6211 of file parameters.hpp.
|
constexpr |
percentage of nodes allowed in the same level of the level graph [0-100]
Definition at line 6207 of file parameters.hpp.
|
constexpr |
minimal weight on an edge (in level graph or bipartite graph)
Definition at line 6217 of file parameters.hpp.
|
constexpr |
maximal number of oddcycle separation rounds per node (-1: unlimited)
Definition at line 6179 of file parameters.hpp.
|
constexpr |
maximal number of oddcycle separation rounds in the root node (-1: unlimited)
Definition at line 6181 of file parameters.hpp.
|
constexpr |
maximal number of oddcycle cuts separated per separation round
Definition at line 6175 of file parameters.hpp.
|
constexpr |
maximal number of oddcycle cuts separated per separation round in the root node
Definition at line 6177 of file parameters.hpp.
|
constexpr |
number of unsuccessful calls at current node
Definition at line 6219 of file parameters.hpp.
|
constexpr |
Even if a variable is already covered by a cut, still try it as start node for a cycle search?
Definition at line 6191 of file parameters.hpp.
|
constexpr |
offset of nodes allowed in the same level of the level graph (additional to the percentage of levelnodes)
Definition at line 6209 of file parameters.hpp.
|
constexpr |
offset of variables to try the chosen method on (additional to the percentage of testvars)
Definition at line 6205 of file parameters.hpp.
|
constexpr |
percentage of variables to try the chosen method on [0-100]
Definition at line 6203 of file parameters.hpp.
|
constexpr |
priority of separator <oddcycle>
Definition at line 6158 of file parameters.hpp.
|
constexpr |
Calculate lifting coefficient of every candidate in every step (or only if its chosen)?
Definition at line 6197 of file parameters.hpp.
|
constexpr |
try to repair violated cycles with double appearance of a variable
Definition at line 6187 of file parameters.hpp.
|
constexpr |
factor for scaling of the arc-weights
Definition at line 6183 of file parameters.hpp.
|
constexpr |
sort level of the root neighbors by fractionality (maxfrac)
Definition at line 6201 of file parameters.hpp.
|
constexpr |
use sorted variable array (unsorted(0), maxlp(1), minlp(2), maxfrac(3), minfrac(4))
Definition at line 6199 of file parameters.hpp.
|
constexpr |
Should the search method by Groetschel, Lovasz, Schrijver be used? Otherwise use levelgraph method by Hoffman, Padberg.
Definition at line 6171 of file parameters.hpp.