24 CompareNewCutsToOldOnes)));
27 CompareNewVarsToOldOnes)));
30 DoReducedCostFixingAtZero)));
33 DoReducedCostFixingAtAnything)));
36 DoReducedCostFixingAtAnything)));
39 ReportWhenDefaultIsExecuted)));
42 NoCompressionAtFathom)));
45 SendFathomedNodeDesc)));
48 Lp_DumpNodeDescCuts)));
51 Lp_DumpNodeDescVars)));
56 LpVerb_AddedCutCount)));
59 LpVerb_AddedVarCount)));
62 LpVerb_ChildrenInfo)));
65 LpVerb_ColumnGenerationInfo)));
68 LpVerb_CutsToCutPoolCount)));
71 LpVerb_VarsToVarPoolCount)));
77 LpVerb_IterationCount)));
80 LpVerb_RelaxedSolution)));
83 LpVerb_FinalRelaxedSolution)));
86 LpVerb_LpMatrixSize)));
89 LpVerb_LpSolutionValue)));
92 LpVerb_MatrixCompression)));
98 LpVerb_PresolvePositions)));
101 LpVerb_PresolveResult)));
104 LpVerb_ProcessedNodeIndex)));
107 LpVerb_ReportCutGenTimeout)));
110 LpVerb_ReportVarGenTimeout)));
113 LpVerb_ReportLocalCutPoolSize)));
116 LpVerb_ReportLocalVarPoolSize)));
119 LpVerb_RepricingResult)));
122 LpVerb_RowEffectivenessCount)));
125 LpVerb_VarTightening)));
128 LpVerb_StrongBranchPositions)));
131 LpVerb_StrongBranchResult)));
134 LpVerb_GeneratedCutCount)));
137 LpVerb_GeneratedVarCount)));
154 SlackCutDiscardingStrategy)));
157 CutEffectiveCountBeforePool)));
160 CutPoolCheckFrequency)));
163 VarPoolCheckFrequency)));
166 IneffectiveConstraints)));
169 IneffectiveBeforeDelete)));
173 MaxNonDualFeasToAdd_Min)));
176 MaxNonDualFeasToAdd_Max)));
184 MaxCutsAddedPerIteration)));
187 MaxVarsAddedPerIteration)));
191 MaxLeftoverCutNum)));
195 DeletedColToCompress_Min)));
198 DeletedRowToCompress_Min)));
211 BranchingObjectComparison)));
238 DeletedColToCompress_Frac)));
241 DeletedRowToCompress_Frac)));
244 MaxNonDualFeasToAdd_Frac)));
247 MaxLeftoverCutFrac)));
254 FirstLP_FirstCutTimeout)));
257 LaterLP_FirstCutTimeout)));
260 FirstLP_AllCutsTimeout)));
263 LaterLP_AllCutsTimeout)));
267 FirstLP_FirstVarTimeout)));
270 LaterLP_FirstVarTimeout)));
273 FirstLP_AllVarsTimeout)));
276 LaterLP_AllVarsTimeout)));
302 set_entry(CompareNewCutsToOldOnes,
true);
303 set_entry(CompareNewVarsToOldOnes,
true);
304 set_entry(DoReducedCostFixingAtZero,
true);
305 set_entry(DoReducedCostFixingAtAnything,
true);
306 set_entry(MessagePassingIsSerial,
false);
307 set_entry(ReportWhenDefaultIsExecuted,
true);
317 set_entry(LpVerb_ColumnGenerationInfo,
true);
318 set_entry(LpVerb_CutsToCutPoolCount,
true);
319 set_entry(LpVerb_VarsToVarPoolCount,
true);
323 set_entry(LpVerb_FinalRelaxedSolution,
true);
326 set_entry(LpVerb_MatrixCompression,
true);
328 set_entry(LpVerb_PresolvePositions,
true);
330 set_entry(LpVerb_ProcessedNodeIndex,
true);
331 set_entry(LpVerb_ReportCutGenTimeout,
true);
332 set_entry(LpVerb_ReportVarGenTimeout,
true);
333 set_entry(LpVerb_ReportLocalCutPoolSize,
true);
334 set_entry(LpVerb_ReportLocalVarPoolSize,
true);
336 set_entry(LpVerb_RowEffectivenessCount,
true);
338 set_entry(LpVerb_StrongBranchPositions,
true);
339 set_entry(LpVerb_StrongBranchResult,
true);
340 set_entry(LpVerb_GeneratedCutCount,
true);
341 set_entry(LpVerb_GeneratedVarCount,
true);
349 set_entry(CutEffectiveCountBeforePool, 1000);
360 set_entry(MaxCutsAddedPerIteration, 100000);
361 set_entry(MaxVarsAddedPerIteration, 100000);
380 set_entry(DeletedColToCompress_Frac, 0.0);
381 set_entry(DeletedRowToCompress_Frac, 0.0);
382 set_entry(MaxNonDualFeasToAdd_Frac, 0.05);
386 set_entry(FirstLP_FirstCutTimeout, -1.0);
387 set_entry(LaterLP_FirstCutTimeout, -1.0);
391 set_entry(FirstLP_FirstVarTimeout, -1.0);
392 set_entry(LaterLP_FirstVarTimeout, -1.0);
BCP_vec< BCP_string > obsolete_keys
list of obsolete keywords.
void create_keyword_list()
Method for creating the list of keyword looked for in the parameter file.
Pack only those variables that are currently at nonzero levels.
The problem is feasible if all non-continuous variables are integral.
Purge the slack cuts at every iteration while processing search tree nodes.
void set_default_entries()
Method for setting the default values for the parameters.
BCP_vec< std::pair< BCP_string, BCP_parameter > > keys
The keyword, parameter pairs.
This class is a very simple impelementation of a constant length string.
void push_back(const_reference x)
Append x to the end of the vector.
Constraints with dual variables at level zero are considered ineffective.
void fint fint fint real fint real real real real real real real real real * e
void set_entry(const chr_params key, const char val)
Use the warmstart info from the end of the parent in the children.
This parameter indeintifies a single parameter entry.
The violation is interpreted in the normal sense, i.e., max(0, max(lb-lhs, lhs-ub)) ...
Keep the child that has the lowest presolved objective value.
