Go to the documentation of this file.
242 inline const std::string&
245 inline const std::vector<std::string>&
252 bpar_[key] = atoi(val) ? true :
false; }
255 bpar_[key] = val ? true :
false; }
261 ipar_[key] = atoi(val); }
267 dpar_[key] = atof(val); }
276 sapar_[key].push_back(val); }
292 for (
size_t j = 0; j <
sapar_[i].size(); ++j)
311 sapar_[i].reserve(str_size);
312 for (
size_t j = 0; j < str_size; ++j){
314 sapar_[i].push_back(std::string());
double entry(const dblParams key) const
@ presolve
Presolve or not.
@ scaleConFactor
Scaling indicator of a constraint.
chrParams
Character parameters.
@ branchStrategy
Branching strategy.
@ cutoff
Cutoff any nodes whose objective value is higher than it.
@ optimalRelGap
If the relative gap between best feasible and best relaxed fall into this gap, search stops.
int entry(const intParams key) const
@ objSense
Objective sense: min = 1.0, max = -1.0.
@ integerTol
Tolerance to treat as an integer.
intParams
Integer paramters.
@ pseudoWeight
Weight used to calculate pseudocost.
void setEntry(const strParams key, const char *val)
@ cutFactor
Limit the max number cuts applied at a node.
@ cutoffInc
The value added to relaxation value when deciding fathom.
void setEntry(const chrParams key, const char *val)
char* is true(1) or false(0), not used
const std::vector< std::string > & entry(const strArrayParams key) const
AlpsEncoded & writeRep(const T &value)
AlpsEncoded & readRep(T &value)
@ heurStrategy
Heuristics control.
@ cutGenerationFrequency
All constraint generators.
@ sharePcostFrequency
Frequency of sharing pseudocost.
void unpack(AlpsEncoded &buf)
Unpack the parameter set from the buffer.
void setEntry(const dblParams key, const double val)
void setEntry(const strArrayParams key, const char *val)
virtual void createKeywordList()
Method for creating the list of keyword looked for in the parameter file.
void pack(AlpsEncoded &buf)
Pack the parameter set into the buffer (AlpsEncoded is used as buffer Here).
@ sharePseudocostSearch
Share pseudocost during search Default: false.
bool entry(const chrParams key) const
void setEntry(const dblParams key, const char *val)
@ pseudoRelibility
The relibility of pseudocost.
virtual void setDefaultEntries()
Method for setting the default values for the parameters.
@ cutCliqueStrategy
The pass to generate cuts for quick branching.
strParams
String parameters.
strArrayParams
There are no string array parameters.
@ denseConFactor
Dense constraint factor.
@ sharePseudocostRampUp
Share pseudocost during ramp up.
@ difference
-1 auto, 0, no, any integer frequency
void setEntry(const chrParams key, const char val)
char is true(1) or false(0), not used
@ shareVariables
Share constraints Default: false.
void setEntry(const intParams key, const int val)
void setEntry(const chrParams key, const bool val)
This method is the one that ever been used.
@ cutStrategy
Cut generators control.
@ quickCutPass
The pass to generate cuts.
@ lookAhead
The look ahead of pseudocost.
@ cutRampUp
Generate cuts during rampup.
const std::string & entry(const strParams key) const
BlisParams()
The default constructor creates a parameter set with from the template argument structure.
@ sharePcostDepth
Maximum tree depth of sharing pseudocost.
std::vector< std::string > * sapar_
@ strongCandSize
The number of candidate used in strong branching.
@ optimalAbsGap
If the absolute gap between best feasible and best relaxed fall into this gap, search stops.
dblParams
Double parameters.
@ shareConstraints
Share constraints Default: false.
void setEntry(const intParams key, const char *val)
@ heurCallFrequency
All heuristics.