Class storing parameters. More...
#include <CglLandP.hpp>
Public Member Functions | |
Parameters () | |
Default constructor (with default values). | |
Parameters (const Parameters &other) | |
Copy constructor. | |
Parameters & | operator= (const Parameters &other) |
Assignment opertator. | |
Public Attributes | |
integer parameters | |
int | pivotLimit |
Max number of pivots before we generate the cut 20. | |
int | pivotLimitInTree |
Max number of pivots at regular nodes. | |
int | maxCutPerRound |
Maximum number of cuts generated at a given round. | |
int | failedPivotLimit |
Maximum number of failed pivots before aborting. | |
int | degeneratePivotLimit |
maximum number of consecutive degenerate pivots 0 | |
double parameters | |
double | pivotTol |
Tolerance for small pivots values (should be the same as the solver. | |
double | away |
A variable have to be at least away from integrity to be generated. | |
double | timeLimit |
Total time limit for cut generation. | |
double | singleCutTimeLimit |
Time limit for generating a single cut. | |
Flags | |
bool | useTableauRow |
Do we use tableau row or the disjunction (I don't really get that there should be a way to always use the tableau). | |
bool | modularize |
Do we apply Egon Balas's Heuristic for modularized cuts. | |
bool | strengthen |
Do we strengthen the final cut (always do if modularize is 1). | |
int | reducedSpace |
Work in the reduced space (only non-structurals enter the basis). | |
bool | perturb |
Apply perturbation procedure. | |
bool | scaleCuts |
Scale the cuts. | |
SelectionRules | pivotSelection |
Which rule to apply for choosing entering and leaving variables. |
Class storing parameters.
Definition at line 67 of file CglLandP.hpp.
CglLandP::Parameters::Parameters | ( | ) |
Default constructor (with default values).
CglLandP::Parameters::Parameters | ( | const Parameters & | other | ) |
Copy constructor.
Parameters& CglLandP::Parameters::operator= | ( | const Parameters & | other | ) | [virtual] |
Assignment opertator.
Reimplemented from CglParam.
Max number of pivots before we generate the cut 20.
Definition at line 80 of file CglLandP.hpp.
Max number of pivots at regular nodes.
Put a value if you want it lower than the global pivot limit. 100.
Definition at line 83 of file CglLandP.hpp.
Maximum number of cuts generated at a given round.
Definition at line 85 of file CglLandP.hpp.
Maximum number of failed pivots before aborting.
Definition at line 87 of file CglLandP.hpp.
maximum number of consecutive degenerate pivots 0
Definition at line 90 of file CglLandP.hpp.
Tolerance for small pivots values (should be the same as the solver.
Definition at line 95 of file CglLandP.hpp.
double CglLandP::Parameters::away |
A variable have to be at least away from integrity to be generated.
Definition at line 97 of file CglLandP.hpp.
double CglLandP::Parameters::timeLimit [mutable] |
Total time limit for cut generation.
Definition at line 99 of file CglLandP.hpp.
Time limit for generating a single cut.
Definition at line 101 of file CglLandP.hpp.
Do we use tableau row or the disjunction (I don't really get that there should be a way to always use the tableau).
Definition at line 107 of file CglLandP.hpp.
Do we apply Egon Balas's Heuristic for modularized cuts.
Definition at line 109 of file CglLandP.hpp.
Do we strengthen the final cut (always do if modularize is 1).
Definition at line 111 of file CglLandP.hpp.
Work in the reduced space (only non-structurals enter the basis).
Definition at line 113 of file CglLandP.hpp.
Apply perturbation procedure.
Definition at line 115 of file CglLandP.hpp.
Scale the cuts.
Definition at line 117 of file CglLandP.hpp.
Which rule to apply for choosing entering and leaving variables.
Definition at line 119 of file CglLandP.hpp.