27#include "AlpsKnowledge.h"
28#include "AlpsParameterBase.h"
200 static_cast<int>(endOfChrParams),
201 static_cast<int>(endOfIntParams),
202 static_cast<int>(endOfDblParams),
203 static_cast<int>(endOfStrParams),
204 static_cast<int>(endOfStrArrayParams)
248 inline const std::string&
251 inline const std::vector<std::string>&
258 bpar_[key] = atoi(val) ? true :
false; }
261 bpar_[key] = val ? true :
false; }
267 ipar_[key] = atoi(val); }
273 dpar_[key] = atof(val); }
282 sapar_[key].push_back(val); }
291 buf.writeRep(bpar_, endOfChrParams)
292 .writeRep(ipar_, endOfIntParams)
293 .writeRep(dpar_, endOfDblParams);
294 for (
int i = 0; i < endOfStrParams; ++i)
295 buf.writeRep(spar_[i]);
296 for (
int i = 0; i < endOfStrArrayParams; ++i) {
297 buf.writeRep(sapar_[i].size());
298 for (
size_t j = 0; j < sapar_[i].size(); ++j)
299 buf.writeRep(sapar_[i][j]);
306 dummy =
static_cast<int>(endOfChrParams);
307 buf.readRep(bpar_, dummy,
false);
308 dummy =
static_cast<int>(endOfIntParams);
309 buf.readRep(ipar_, dummy,
false);
310 dummy =
static_cast<int>(endOfDblParams);
311 buf.readRep(dpar_, dummy,
false);
312 for (
int i = 0; i < endOfStrParams; ++i)
313 buf.readRep(spar_[i]);
314 for (
int i = 0; i < endOfStrArrayParams; ++i) {
316 buf.readRep(str_size);
317 sapar_[i].reserve(str_size);
318 for (
size_t j = 0; j < str_size; ++j){
320 sapar_[i].push_back(std::string());
321 buf.readRep(sapar_[i].back());
void setEntry(const dblParams key, const char *val)
virtual void setDefaultEntries()
Method for setting the default values for the parameters.
void setEntry(const intParams key, const int 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 setEntry(const chrParams key, const bool val)
This method is the one that ever been used.
dblParams
Double parameters.
@ cutFactor
Limit the max number cuts applied at a node.
@ cutoffInc
The value added to relaxation value when deciding fathom.
@ pseudoWeight
Weight used to calculate pseudocost.
@ optimalRelGap
If the relative gap between best feasible and best relaxed fall into this gap, search stops.
@ objSense
Objective sense: min = 1.0, max = -1.0.
@ integerTol
Tolerance to treat as an integer.
@ optimalAbsGap
If the absolute gap between best feasible and best relaxed fall into this gap, search stops.
@ denseConFactor
Dense constraint factor.
@ scaleConFactor
Scaling indicator of a constraint.
@ cutoff
Cutoff any nodes whose objective value is higher than it.
strArrayParams
There are no string array parameters.
double entry(const dblParams key) const
void setEntry(const intParams key, const char *val)
void setEntry(const chrParams key, const char *val)
char* is true(1) or false(0), not used
void setEntry(const dblParams key, const double val)
const std::vector< std::string > & entry(const strArrayParams key) const
const std::string & entry(const strParams key) const
chrParams
Character parameters.
@ sharePseudocostRampUp
Share pseudocost during ramp up.
@ presolve
Presolve or not.
@ checkFeasibleInBranch
Whether to check whether solutions are feasible during strong branching Default: true.
@ shareConstraints
Share constraints Default: false.
@ cutRampUp
Generate cuts during rampup.
@ sharePseudocostSearch
Share pseudocost during search Default: false.
@ shareVariables
Share constraints Default: false.
bool entry(const chrParams key) const
BlisParams()
The default constructor creates a parameter set with from the template argument structure.
void setEntry(const strParams key, const char *val)
void unpack(AlpsEncoded &buf)
Unpack the parameter set from the buffer.
int entry(const intParams key) const
strParams
String parameters.
void pack(AlpsEncoded &buf)
Pack the parameter set into the buffer (AlpsEncoded is used as buffer Here).
void setEntry(const chrParams key, const char val)
char is true(1) or false(0), not used
intParams
Integer paramters.
@ branchStrategy
Branching strategy.
@ heurCallFrequency
All heuristics.
@ cutStrategy
Cut generators control.
@ lookAhead
The look ahead of pseudocost.
@ sharePcostFrequency
Frequency of sharing pseudocost.
@ cutCliqueStrategy
The pass to generate cuts for quick branching.
@ strongCandSize
The number of candidate used in strong branching.
@ heurStrategy
Heuristics control.
@ difference
-1 auto, 0, no, any integer frequency
@ cutGenerationFrequency
All constraint generators.
@ sharePcostDepth
Maximum tree depth of sharing pseudocost.
@ pseudoRelibility
The relibility of pseudocost.
@ quickCutPass
The pass to generate cuts.