coin-Bcp
BCP_lp_param.hpp
Go to the documentation of this file.
1 // Copyright (C) 2000, International Business Machines
2 // Corporation and others. All Rights Reserved.
3 #ifndef _BCP_LP_PARAM_H
4 #define _BCP_LP_PARAM_H
5 
6 // This file is fully docified.
7 
8 //-----------------------------------------------------------------------------
9 
14 struct BCP_lp_par{
17  enum chr_params{
57 
61 
158  //
160  };
161 
168 
204 
217 
225 
234 
239 
252 
283 
308  //
310  };
311 
346 
383 
418 
419  //
421  };
422 
427  //
429  };
430 
433  // the dummy is needed so the allocation won't try for 0 entries
435  //
437  };
438 
439 };
440 
441 #endif
int_params
Integer parameters.
How many times in a row a constraint must be found ineffective before it is marked for deletion...
This and the following three parameters control how long the LP process waits for generated cuts...
Values not further from an integer value than the value of this parameter are considered to be intege...
If true the BCP will attempt to do reduced cost fixing for any variable, no matter what is their curr...
str_params
String parameters.
Print the number of cuts sent from the LP to the cut pool.
Specifies which built-in MIP feasibility testing routine should be invoked (if a buit-in routine is u...
Print information if receiving variables is timed out.
Upper limit on the number of iterations performed in each of the children of the search tree node whe...
The minimum difference between the objective value of any two feasible solution (with different objec...
Just a marker for the first LpVerb.
How cut violation should be computed.
Print the number of cuts generated during this iteration (since the LP was resolved last time)...
Parameters used in the LP process.
Print the number of variables generated during this iteration.
Print out a message when the default version of an overridable method is executed.
The maximum fraction of the violated but not added cuts to be kept from one iteration to the next...
Print information on the branching candidate selected by strong branching.
If true the BCP will attempt to do reduced cost fixing only for variables currently at zero...
Specifies the rule used for built-in branching object comparison (if the buit-in routine is used at a...
**** This parameter is not used anywhere!!! ****
Indicates what part of the primal solution is sent to the Cut Generator process if the BCP_lp_user::p...
If true then the LP process will check each newly received cut whether it already exists in the local...
Maximum allowed running time.
Print the size of the problem matrix and the LP solution value after resolving the LP...
Indicates whether message passing is serial (all processes are on the same processor) or not...
Turn on the user hook "display_lp_solution".
The number of rows that must be marked for deletion before matrix compression can occur...
Print the "Starting iteration x" line.
Print the number of variables generated before resolving the Lp ir fathoming a node.
**** This parameter is not used anywhere!!! ****
Print the number of variables added from the local variable pool in the curent iteration.
Print the current number of cuts in the cut pool.
Indicates which constraints should be considered ineffective.
Whether to send back the description of fathomed search tree nodes to the Tree Manager.
Similar as above for variables.
Specifies how warmstart information should be stored in the TM.
The Variable Pool is queried for columns that improve the formulation after the first LP realxation i...
This parameter specifies the time to wait for variables at the first LP relaxation at a search tree n...
Print detailed information on the branching candidate selected by strong branching.
**** This parameter is not used anywhere!!! ****
Specifies how many branching variables with values close to half between two integers should be chose...
This parameter specifies the time to wait for cuts at iterations that are not the first at a search t...
The slack cut discarding strategy used in the default version of the function purge_slack_pool().
After a branching object is selected print what happens to the presolved children (e...
Print the number of variables whose bounds have been changed by reduced cost fixing or logical fixing...
chr_params
Character parameters.
The maximum number of variables that can be added per iteration.
The number of columns that must be marked for deletion before matrix compression can occur...
This parameter specifies the time to wait for cuts at the first LP relaxation at a search tree node...
The number of non dual-feasible colums that can be added at a time to the formulation is a certain fr...
If true then the LP process will check each newly arrived variable whether it already exists in the l...
For each tree node print out how much time was spent on it.
The filename all the output should go to.
Just a marker for the last LpVerb.
str_array_params
There are no string array parameters.
This and the following three parameters control how long the LP process waits for generated variables...
Print information related to fathoming.
What should be the "niceness" of the LP process.
Indicates what part of the dual solution is sent to the Variable Generator process if the BCP_lp_user...
The maximum number of violated but not added cuts to be kept from one iteration to the next...
The fraction of columns that must be marked for deletion before matrix compression can occur...
See the description of the previous parameter.
Print information on the presolved branching candidates during strong branching.
Whether we should refrain from compressing the problem description right before a fathomed node's des...
Indicates how matrix scaling should be performed.
Turn on the user hook "display_lp_solution" for the last LP relaxation solved at a search tree node...
The number of non dual-feasible colums that can be added to the formulation at a time cannot exceed t...
Print the number of ineffective rows in the current problem.
This parameter specifies the time to wait for the first generated cut at iterations that are not the ...
This parameter specifies the time to wait for variables at iterations that are not the first at a sea...
Print the number of columns and rows that were deleted during matrix compression. ...
Specifies the rule used for selecting one of the children of the search tree node for diving...
The Cut Pool is queried for violated valid inequalities after the first LP relaxation is solved and t...
The fraction of rows that must be marked for deletion before matrix compression can occur...
Print the "Processing NODE x on LEVEL y" line.
<bf>Deprecated parameter.
A cut has to remain effective through this many iterations in the LP before it is sent to the Cut Poo...
dbl_params
Double parameters.
Print information if receiving cuts is timed out.
The maximum number of violated valid inequalities that can be added per iteration.
This parameter specifies the time to wait for the first generated variable at iterations that are not...
If true, BCP supports branching on cuts by providing potential branching candidates for the user...
Print detailed information about all the branching candidates during strong branching.
Print the number of cuts added from the local cut pool in the current iteration.