Cbc  2.9.9
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Classes | Friends | List of all members
CglProbing Class Reference

Probing Cut Generator Class. More...

#include <CglProbing.hpp>

+ Inheritance diagram for CglProbing:
+ Collaboration diagram for CglProbing:

Classes

struct  CliqueType
 Clique type. More...
 
struct  disaggregation_struct_tag
 Disaggregation cuts and for building cliques. More...
 

Public Member Functions

Generate Cuts
virtual void generateCuts (const OsiSolverInterface &si, OsiCuts &cs, const CglTreeInfo info=CglTreeInfo())
 Generate probing/disaggregation cuts for the model of the solver interface, si. More...
 
int generateCutsAndModify (const OsiSolverInterface &si, OsiCuts &cs, CglTreeInfo *info)
 
snapshot etc
int snapshot (const OsiSolverInterface &si, char *possible=NULL, bool withObjective=true)
 Create a copy of matrix which is to be used this is to speed up process and to give global cuts Can give an array with 1 set to select, 0 to ignore column bounds are tightened If array given then values of 1 will be set to 0 if redundant. More...
 
void deleteSnapshot ()
 Deletes snapshot. More...
 
int createCliques (OsiSolverInterface &si, int minimumSize=2, int maximumSize=100)
 Creates cliques for use by probing. More...
 
void deleteCliques ()
 Delete all clique information. More...
 
OsiSolverInterfacecliqueModel (const OsiSolverInterface *model, int type)
 Create a fake model by adding cliques if type&4 then delete rest of model first, if 1 then add proper cliques, 2 add fake cliques. More...
 
Get tighter column bounds
const double * tightLower () const
 Lower. More...
 
const double * tightUpper () const
 Upper. More...
 
const char * tightenBounds () const
 Array which says tighten continuous. More...
 
Get possible freed up row bounds - only valid after mode==3
const double * relaxedRowLower () const
 Lower. More...
 
const double * relaxedRowUpper () const
 Upper. More...
 
Change mode
void setMode (int mode)
 Set. More...
 
int getMode () const
 Get. More...
 
Change maxima
void setMaxPass (int value)
 Set maximum number of passes per node. More...
 
int getMaxPass () const
 Get maximum number of passes per node. More...
 
void setLogLevel (int value)
 Set log level - 0 none, 1 - a bit, 2 - more details. More...
 
int getLogLevel () const
 Get log level. More...
 
void setMaxProbe (int value)
 Set maximum number of unsatisfied variables to look at. More...
 
int getMaxProbe () const
 Get maximum number of unsatisfied variables to look at. More...
 
void setMaxLook (int value)
 Set maximum number of variables to look at in one probe. More...
 
int getMaxLook () const
 Get maximum number of variables to look at in one probe. More...
 
void setMaxElements (int value)
 Set maximum number of elements in row for it to be considered. More...
 
int getMaxElements () const
 Get maximum number of elements in row for it to be considered. More...
 
void setMaxPassRoot (int value)
 Set maximum number of passes per node (root node) More...
 
int getMaxPassRoot () const
 Get maximum number of passes per node (root node) More...
 
void setMaxProbeRoot (int value)
 Set maximum number of unsatisfied variables to look at (root node) More...
 
int getMaxProbeRoot () const
 Get maximum number of unsatisfied variables to look at (root node) More...
 
void setMaxLookRoot (int value)
 Set maximum number of variables to look at in one probe (root node) More...
 
int getMaxLookRoot () const
 Get maximum number of variables to look at in one probe (root node) More...
 
void setMaxElementsRoot (int value)
 Set maximum number of elements in row for it to be considered (root node) More...
 
int getMaxElementsRoot () const
 Get maximum number of elements in row for it to be considered (root node) More...
 
virtual bool mayGenerateRowCutsInTree () const
 Returns true if may generate Row cuts in tree (rather than root node). More...
 
Get information back from probing
int numberThisTime () const
 Number looked at this time. More...
 
const int * lookedAt () const
 Which ones looked at this time. More...
 
Stop or restart row cuts (otherwise just fixing from probing)
void setRowCuts (int type)
 Set 0 no cuts, 1 just disaggregation type, 2 coefficient ( 3 both) More...
 
int rowCuts () const
 Get. More...
 
Information on cliques
int numberCliques () const
 Number of cliques. More...
 
CliqueTypecliqueType () const
 Clique type. More...
 
int * cliqueStart () const
 Start of each clique. More...
 
CliqueEntrycliqueEntry () const
 Entries for clique. More...
 
Whether use objective as constraint
void setUsingObjective (int yesNo)
 Set 0 don't 1 do -1 don't even think about it. More...
 
int getUsingObjective () const
 Get. More...
 
Mark which continuous variables are to be tightened
void tightenThese (const OsiSolverInterface &solver, int number, const int *which)
 Mark variables to be tightened. More...
 
Constructors and destructors
 CglProbing ()
 Default constructor. More...
 
 CglProbing (const CglProbing &)
 Copy constructor. More...
 
virtual CglCutGeneratorclone () const
 Clone. More...
 
CglProbingoperator= (const CglProbing &rhs)
 Assignment operator. More...
 
virtual ~CglProbing ()
 Destructor. More...
 
virtual void refreshSolver (OsiSolverInterface *solver)
 This can be used to refresh any inforamtion. More...
 
virtual std::string generateCpp (FILE *fp)
 Create C++ lines to get to current state. More...
 
- Public Member Functions inherited from CglCutGenerator
 CglCutGenerator ()
 Default constructor. More...
 
 CglCutGenerator (const CglCutGenerator &)
 Copy constructor. More...
 
CglCutGeneratoroperator= (const CglCutGenerator &rhs)
 Assignment operator. More...
 
virtual ~CglCutGenerator ()
 Destructor. More...
 
int getAggressiveness () const
 Get Aggressiveness - 0 = neutral, 100 is normal root node. More...
 
void setAggressiveness (int value)
 Set Aggressiveness - 0 = neutral, 100 is normal root node. More...
 
void setGlobalCuts (bool trueOrFalse)
 Set whether can do global cuts. More...
 
bool canDoGlobalCuts () const
 Say whether can do global cuts. More...
 
virtual bool needsOptimalBasis () const
 Return true if needs optimal basis to do cuts. More...
 
virtual int maximumLengthOfCutInTree () const
 Return maximum length of cut in tree. More...
 

Private Member Functions

probe
int probe (const OsiSolverInterface &si, const OsiRowCutDebugger *debugger, OsiCuts &cs, double *colLower, double *colUpper, CoinPackedMatrix *rowCopy, CoinPackedMatrix *columnCopy, const CoinBigIndex *rowStartPos, const int *realRow, const double *rowLower, const double *rowUpper, const char *intVar, double *minR, double *maxR, int *markR, CglTreeInfo *info)
 Does probing and adding cuts (without cliques and mode_!=0) More...
 
int probeCliques (const OsiSolverInterface &si, const OsiRowCutDebugger *debugger, OsiCuts &cs, double *colLower, double *colUpper, CoinPackedMatrix *rowCopy, CoinPackedMatrix *columnCopy, const int *realRow, double *rowLower, double *rowUpper, char *intVar, double *minR, double *maxR, int *markR, CglTreeInfo *info)
 Does probing and adding cuts (with cliques) More...
 
int probeSlacks (const OsiSolverInterface &si, const OsiRowCutDebugger *debugger, OsiCuts &cs, double *colLower, double *colUpper, CoinPackedMatrix *rowCopy, CoinPackedMatrix *columnCopy, double *rowLower, double *rowUpper, char *intVar, double *minR, double *maxR, int *markR, CglTreeInfo *info)
 Does probing and adding cuts for clique slacks. More...
 
int gutsOfGenerateCuts (const OsiSolverInterface &si, OsiCuts &cs, double *rowLower, double *rowUpper, double *colLower, double *colUpper, CglTreeInfo *info)
 Does most of work of generateCuts Returns number of infeasibilities. More...
 
void setupRowCliqueInformation (const OsiSolverInterface &si)
 Sets up clique information for each row. More...
 
int tighten (double *colLower, double *colUpper, const int *column, const double *rowElements, const CoinBigIndex *rowStart, const CoinBigIndex *rowStartPos, const int *rowLength, double *rowLower, double *rowUpper, int nRows, int nCols, char *intVar, int maxpass, double tolerance)
 This tightens column bounds (and can declare infeasibility) It may also declare rows to be redundant. More...
 
void tighten2 (double *colLower, double *colUpper, const int *column, const double *rowElements, const CoinBigIndex *rowStart, const int *rowLength, double *rowLower, double *rowUpper, double *minR, double *maxR, int *markR, int nRows)
 This just sets minima and maxima on rows. More...
 

Friends

struct CglProbing::disaggregation_struct_tag
 
void CglProbingUnitTest (const OsiSolverInterface *siP, const std::string mpdDir)
 A function that tests the methods in the CglProbing class. More...
 

Private member data

typedef struct
CglProbing::disaggregation_struct_tag 
disaggregation
 Disaggregation cuts and for building cliques. More...
 
CoinPackedMatrixrowCopy_
 Row copy (only if snapshot) More...
 
CoinPackedMatrixcolumnCopy_
 Column copy (only if snapshot) More...
 
double * rowLower_
 Lower bounds on rows. More...
 
double * rowUpper_
 Upper bounds on rows. More...
 
double * colLower_
 Lower bounds on columns. More...
 
double * colUpper_
 Upper bounds on columns. More...
 
int numberRows_
 Number of rows in snapshot (or when cliqueRow stuff computed) More...
 
int numberColumns_
 Number of columns in problem ( must == current) More...
 
double primalTolerance_
 Tolerance to see if infeasible. More...
 
int mode_
 Mode - 0 lazy using snapshot, 1 just unsatisfied, 2 all. More...
 
int rowCuts_
 Row cuts flag 0 no cuts, 1 just disaggregation type, 2 coefficient ( 3 both), 4 just column cuts -n as +n but just fixes variables unless at root. More...
 
int maxPass_
 Maximum number of passes to do in probing. More...
 
int logLevel_
 Log level - 0 none, 1 - a bit, 2 - more details. More...
 
int maxProbe_
 Maximum number of unsatisfied variables to probe. More...
 
int maxStack_
 Maximum number of variables to look at in one probe. More...
 
int maxElements_
 Maximum number of elements in row for scan. More...
 
int maxPassRoot_
 Maximum number of passes to do in probing at root. More...
 
int maxProbeRoot_
 Maximum number of unsatisfied variables to probe at root. More...
 
int maxStackRoot_
 Maximum number of variables to look at in one probe at root. More...
 
int maxElementsRoot_
 Maximum number of elements in row for scan at root. More...
 
int usingObjective_
 Whether to include objective as constraint. More...
 
int numberIntegers_
 Number of integer variables. More...
 
int number01Integers_
 Number of 0-1 integer variables. More...
 
int numberThisTime_
 Number looked at this time. More...
 
int totalTimesCalled_
 Total number of times called. More...
 
int * lookedAt_
 Which ones looked at this time. More...
 
disaggregationcutVector_
 
int numberCliques_
 Cliques Number of cliques. More...
 
CliqueTypecliqueType_
 Clique type. More...
 
int * cliqueStart_
 Start of each clique. More...
 
CliqueEntrycliqueEntry_
 Entries for clique. More...
 
int * oneFixStart_
 Start of oneFixes cliques for a column in matrix or -1 if not in any clique. More...
 
int * zeroFixStart_
 Start of zeroFixes cliques for a column in matrix or -1 if not in any clique. More...
 
int * endFixStart_
 End of fixes for a column. More...
 
int * whichClique_
 Clique numbers for one or zero fixes. More...
 
CliqueEntrycliqueRow_
 For each column with nonzero in row copy this gives a clique "number". More...
 
int * cliqueRowStart_
 cliqueRow_ starts for each row More...
 
char * tightenBounds_
 If not null and [i] !=0 then also tighten even if continuous. More...
 

Additional Inherited Members

- Public Attributes inherited from CglCutGenerator
int aggressive_
 Aggressiveness - 0 = neutral, 100 is normal root node. More...
 
bool canDoGlobalCuts_
 True if can do global cuts i.e. no general integers. More...
 

Detailed Description

Probing Cut Generator Class.

Definition at line 25 of file CglProbing.hpp.

Member Typedef Documentation

Disaggregation cuts and for building cliques.

Constructor & Destructor Documentation

CglProbing::CglProbing ( )

Default constructor.

CglProbing::CglProbing ( const CglProbing )

Copy constructor.

virtual CglProbing::~CglProbing ( )
virtual

Destructor.

Member Function Documentation

virtual void CglProbing::generateCuts ( const OsiSolverInterface si,
OsiCuts cs,
const CglTreeInfo  info = CglTreeInfo() 
)
virtual

Generate probing/disaggregation cuts for the model of the solver interface, si.

This is a simplification of probing ideas put into OSL about ten years ago. The only known documentation is a copy of a talk handout - we think Robin Lougee-Heimer has a copy!

For selected integer variables (e.g. unsatisfied ones) the effect of setting them up or down is investigated. Setting a variable up may in turn set other variables (continuous as well as integer). There are various possible results:

1) It is shown that problem is infeasible (this may also be because objective function or reduced costs show worse than best solution). If the other way is feasible we can generate a column cut (and continue probing), if not feasible we can say problem infeasible.

2) If both ways are feasible, it can happen that x to 0 implies y to 1 and x to 1 implies y to 1 (again a column cut). More common is that x to 0 implies y to 1 and x to 1 implies y to 0 so we could substitute for y which might lead later to more powerful cuts. This is not done in this code as there is no mechanism for returning information.

3) When x to 1 a constraint went slack by c. We can tighten the constraint ax + .... <= b (where a may be zero) to (a+c)x + .... <= b. If this cut is violated then it is generated.

4) Similarly we can generate implied disaggregation cuts

Note - differences to cuts in OSL.

a) OSL had structures intended to make this faster. b) The "chaining" in 2) was done c) Row cuts modified original constraint rather than adding cut b) This code can cope with general integer variables.

Insert the generated cuts into OsiCut, cs.

If a "snapshot" of a matrix exists then this will be used. Presumably this will give global cuts and will be faster. No check is done to see if cuts will be global.

Otherwise use current matrix.

Both row cuts and column cuts may be returned

The mode options are: 0) Only unsatisfied integer variables will be looked at. If no information exists for that variable then probing will be done so as a by-product you "may" get a fixing or infeasibility. This will be fast and is only available if a snapshot exists (otherwise as 1). The bounds in the snapshot are the ones used. 1) Look at unsatisfied integer variables, using current bounds. Probing will be done on all looked at. 2) Look at all integer variables, using current bounds. Probing will be done on all

If generateCutsAndModify is used then new relaxed row bounds and tightened column bounds are generated Returns number of infeasibilities

Implements CglCutGenerator.

int CglProbing::generateCutsAndModify ( const OsiSolverInterface si,
OsiCuts cs,
CglTreeInfo info 
)
int CglProbing::snapshot ( const OsiSolverInterface si,
char *  possible = NULL,
bool  withObjective = true 
)

Create a copy of matrix which is to be used this is to speed up process and to give global cuts Can give an array with 1 set to select, 0 to ignore column bounds are tightened If array given then values of 1 will be set to 0 if redundant.

Objective may be added as constraint Returns 1 if infeasible otherwise 0

void CglProbing::deleteSnapshot ( )

Deletes snapshot.

int CglProbing::createCliques ( OsiSolverInterface si,
int  minimumSize = 2,
int  maximumSize = 100 
)

Creates cliques for use by probing.

Only cliques >= minimumSize and < maximumSize created Can also try and extend cliques as a result of probing (root node). Returns number of cliques found.

void CglProbing::deleteCliques ( )

Delete all clique information.

OsiSolverInterface* CglProbing::cliqueModel ( const OsiSolverInterface model,
int  type 
)

Create a fake model by adding cliques if type&4 then delete rest of model first, if 1 then add proper cliques, 2 add fake cliques.

const double* CglProbing::tightLower ( ) const

Lower.

const double* CglProbing::tightUpper ( ) const

Upper.

const char* CglProbing::tightenBounds ( ) const
inline

Array which says tighten continuous.

Definition at line 143 of file CglProbing.hpp.

const double* CglProbing::relaxedRowLower ( ) const

Lower.

const double* CglProbing::relaxedRowUpper ( ) const

Upper.

void CglProbing::setMode ( int  mode)

Set.

int CglProbing::getMode ( ) const

Get.

void CglProbing::setMaxPass ( int  value)

Set maximum number of passes per node.

int CglProbing::getMaxPass ( ) const

Get maximum number of passes per node.

void CglProbing::setLogLevel ( int  value)

Set log level - 0 none, 1 - a bit, 2 - more details.

int CglProbing::getLogLevel ( ) const

Get log level.

void CglProbing::setMaxProbe ( int  value)

Set maximum number of unsatisfied variables to look at.

int CglProbing::getMaxProbe ( ) const

Get maximum number of unsatisfied variables to look at.

void CglProbing::setMaxLook ( int  value)

Set maximum number of variables to look at in one probe.

int CglProbing::getMaxLook ( ) const

Get maximum number of variables to look at in one probe.

void CglProbing::setMaxElements ( int  value)

Set maximum number of elements in row for it to be considered.

int CglProbing::getMaxElements ( ) const

Get maximum number of elements in row for it to be considered.

void CglProbing::setMaxPassRoot ( int  value)

Set maximum number of passes per node (root node)

int CglProbing::getMaxPassRoot ( ) const

Get maximum number of passes per node (root node)

void CglProbing::setMaxProbeRoot ( int  value)

Set maximum number of unsatisfied variables to look at (root node)

int CglProbing::getMaxProbeRoot ( ) const

Get maximum number of unsatisfied variables to look at (root node)

void CglProbing::setMaxLookRoot ( int  value)

Set maximum number of variables to look at in one probe (root node)

int CglProbing::getMaxLookRoot ( ) const

Get maximum number of variables to look at in one probe (root node)

void CglProbing::setMaxElementsRoot ( int  value)

Set maximum number of elements in row for it to be considered (root node)

int CglProbing::getMaxElementsRoot ( ) const

Get maximum number of elements in row for it to be considered (root node)

virtual bool CglProbing::mayGenerateRowCutsInTree ( ) const
virtual

Returns true if may generate Row cuts in tree (rather than root node).

Used so know if matrix will change in tree. Really meant so column cut generators can still be active without worrying code. Default is true

Reimplemented from CglCutGenerator.

int CglProbing::numberThisTime ( ) const
inline

Number looked at this time.

Definition at line 214 of file CglProbing.hpp.

const int* CglProbing::lookedAt ( ) const
inline

Which ones looked at this time.

Definition at line 217 of file CglProbing.hpp.

void CglProbing::setRowCuts ( int  type)

Set 0 no cuts, 1 just disaggregation type, 2 coefficient ( 3 both)

int CglProbing::rowCuts ( ) const

Get.

int CglProbing::numberCliques ( ) const
inline

Number of cliques.

Definition at line 237 of file CglProbing.hpp.

CliqueType* CglProbing::cliqueType ( ) const
inline

Clique type.

Definition at line 240 of file CglProbing.hpp.

int* CglProbing::cliqueStart ( ) const
inline

Start of each clique.

Definition at line 243 of file CglProbing.hpp.

CliqueEntry* CglProbing::cliqueEntry ( ) const
inline

Entries for clique.

Definition at line 246 of file CglProbing.hpp.

void CglProbing::setUsingObjective ( int  yesNo)

Set 0 don't 1 do -1 don't even think about it.

int CglProbing::getUsingObjective ( ) const

Get.

void CglProbing::tightenThese ( const OsiSolverInterface solver,
int  number,
const int *  which 
)

Mark variables to be tightened.

virtual CglCutGenerator* CglProbing::clone ( ) const
virtual

Clone.

Implements CglCutGenerator.

CglProbing& CglProbing::operator= ( const CglProbing rhs)

Assignment operator.

virtual void CglProbing::refreshSolver ( OsiSolverInterface solver)
virtual

This can be used to refresh any inforamtion.

Reimplemented from CglCutGenerator.

virtual std::string CglProbing::generateCpp ( FILE *  fp)
virtual

Create C++ lines to get to current state.

Reimplemented from CglCutGenerator.

int CglProbing::probe ( const OsiSolverInterface si,
const OsiRowCutDebugger debugger,
OsiCuts cs,
double *  colLower,
double *  colUpper,
CoinPackedMatrix rowCopy,
CoinPackedMatrix columnCopy,
const CoinBigIndex rowStartPos,
const int *  realRow,
const double *  rowLower,
const double *  rowUpper,
const char *  intVar,
double *  minR,
double *  maxR,
int *  markR,
CglTreeInfo info 
)
private

Does probing and adding cuts (without cliques and mode_!=0)

int CglProbing::probeCliques ( const OsiSolverInterface si,
const OsiRowCutDebugger debugger,
OsiCuts cs,
double *  colLower,
double *  colUpper,
CoinPackedMatrix rowCopy,
CoinPackedMatrix columnCopy,
const int *  realRow,
double *  rowLower,
double *  rowUpper,
char *  intVar,
double *  minR,
double *  maxR,
int *  markR,
CglTreeInfo info 
)
private

Does probing and adding cuts (with cliques)

int CglProbing::probeSlacks ( const OsiSolverInterface si,
const OsiRowCutDebugger debugger,
OsiCuts cs,
double *  colLower,
double *  colUpper,
CoinPackedMatrix rowCopy,
CoinPackedMatrix columnCopy,
double *  rowLower,
double *  rowUpper,
char *  intVar,
double *  minR,
double *  maxR,
int *  markR,
CglTreeInfo info 
)
private

Does probing and adding cuts for clique slacks.

int CglProbing::gutsOfGenerateCuts ( const OsiSolverInterface si,
OsiCuts cs,
double *  rowLower,
double *  rowUpper,
double *  colLower,
double *  colUpper,
CglTreeInfo info 
)
private

Does most of work of generateCuts Returns number of infeasibilities.

void CglProbing::setupRowCliqueInformation ( const OsiSolverInterface si)
private

Sets up clique information for each row.

int CglProbing::tighten ( double *  colLower,
double *  colUpper,
const int *  column,
const double *  rowElements,
const CoinBigIndex rowStart,
const CoinBigIndex rowStartPos,
const int *  rowLength,
double *  rowLower,
double *  rowUpper,
int  nRows,
int  nCols,
char *  intVar,
int  maxpass,
double  tolerance 
)
private

This tightens column bounds (and can declare infeasibility) It may also declare rows to be redundant.

void CglProbing::tighten2 ( double *  colLower,
double *  colUpper,
const int *  column,
const double *  rowElements,
const CoinBigIndex rowStart,
const int *  rowLength,
double *  rowLower,
double *  rowUpper,
double *  minR,
double *  maxR,
int *  markR,
int  nRows 
)
private

This just sets minima and maxima on rows.

Friends And Related Function Documentation

Definition at line 357 of file CglProbing.hpp.

void CglProbingUnitTest ( const OsiSolverInterface siP,
const std::string  mpdDir 
)
friend

A function that tests the methods in the CglProbing class.

The only reason for it not to be a member method is that this way it doesn't have to be compiled into the library. And that's a gain, because the library should be compiled with optimization on, but this method should be compiled with debugging.

Member Data Documentation

CoinPackedMatrix* CglProbing::rowCopy_
private

Row copy (only if snapshot)

Definition at line 363 of file CglProbing.hpp.

CoinPackedMatrix* CglProbing::columnCopy_
private

Column copy (only if snapshot)

Definition at line 365 of file CglProbing.hpp.

double* CglProbing::rowLower_
private

Lower bounds on rows.

Definition at line 367 of file CglProbing.hpp.

double* CglProbing::rowUpper_
private

Upper bounds on rows.

Definition at line 369 of file CglProbing.hpp.

double* CglProbing::colLower_
private

Lower bounds on columns.

Definition at line 371 of file CglProbing.hpp.

double* CglProbing::colUpper_
private

Upper bounds on columns.

Definition at line 373 of file CglProbing.hpp.

int CglProbing::numberRows_
private

Number of rows in snapshot (or when cliqueRow stuff computed)

Definition at line 375 of file CglProbing.hpp.

int CglProbing::numberColumns_
private

Number of columns in problem ( must == current)

Definition at line 377 of file CglProbing.hpp.

double CglProbing::primalTolerance_
private

Tolerance to see if infeasible.

Definition at line 379 of file CglProbing.hpp.

int CglProbing::mode_
private

Mode - 0 lazy using snapshot, 1 just unsatisfied, 2 all.

16 bit set if want to extend cliques at root node

Definition at line 383 of file CglProbing.hpp.

int CglProbing::rowCuts_
private

Row cuts flag 0 no cuts, 1 just disaggregation type, 2 coefficient ( 3 both), 4 just column cuts -n as +n but just fixes variables unless at root.

Definition at line 388 of file CglProbing.hpp.

int CglProbing::maxPass_
private

Maximum number of passes to do in probing.

Definition at line 390 of file CglProbing.hpp.

int CglProbing::logLevel_
private

Log level - 0 none, 1 - a bit, 2 - more details.

Definition at line 392 of file CglProbing.hpp.

int CglProbing::maxProbe_
private

Maximum number of unsatisfied variables to probe.

Definition at line 394 of file CglProbing.hpp.

int CglProbing::maxStack_
private

Maximum number of variables to look at in one probe.

Definition at line 396 of file CglProbing.hpp.

int CglProbing::maxElements_
private

Maximum number of elements in row for scan.

Definition at line 398 of file CglProbing.hpp.

int CglProbing::maxPassRoot_
private

Maximum number of passes to do in probing at root.

Definition at line 400 of file CglProbing.hpp.

int CglProbing::maxProbeRoot_
private

Maximum number of unsatisfied variables to probe at root.

Definition at line 402 of file CglProbing.hpp.

int CglProbing::maxStackRoot_
private

Maximum number of variables to look at in one probe at root.

Definition at line 404 of file CglProbing.hpp.

int CglProbing::maxElementsRoot_
private

Maximum number of elements in row for scan at root.

Definition at line 406 of file CglProbing.hpp.

int CglProbing::usingObjective_
private

Whether to include objective as constraint.

Definition at line 408 of file CglProbing.hpp.

int CglProbing::numberIntegers_
private

Number of integer variables.

Definition at line 410 of file CglProbing.hpp.

int CglProbing::number01Integers_
private

Number of 0-1 integer variables.

Definition at line 412 of file CglProbing.hpp.

int CglProbing::numberThisTime_
private

Number looked at this time.

Definition at line 414 of file CglProbing.hpp.

int CglProbing::totalTimesCalled_
private

Total number of times called.

Definition at line 416 of file CglProbing.hpp.

int* CglProbing::lookedAt_
private

Which ones looked at this time.

Definition at line 418 of file CglProbing.hpp.

disaggregation* CglProbing::cutVector_
private

Definition at line 426 of file CglProbing.hpp.

int CglProbing::numberCliques_
private

Cliques Number of cliques.

Definition at line 429 of file CglProbing.hpp.

CliqueType* CglProbing::cliqueType_
private

Clique type.

Definition at line 431 of file CglProbing.hpp.

int* CglProbing::cliqueStart_
private

Start of each clique.

Definition at line 433 of file CglProbing.hpp.

CliqueEntry* CglProbing::cliqueEntry_
private

Entries for clique.

Definition at line 435 of file CglProbing.hpp.

int* CglProbing::oneFixStart_
private

Start of oneFixes cliques for a column in matrix or -1 if not in any clique.

Definition at line 438 of file CglProbing.hpp.

int* CglProbing::zeroFixStart_
private

Start of zeroFixes cliques for a column in matrix or -1 if not in any clique.

Definition at line 441 of file CglProbing.hpp.

int* CglProbing::endFixStart_
private

End of fixes for a column.

Definition at line 443 of file CglProbing.hpp.

int* CglProbing::whichClique_
private

Clique numbers for one or zero fixes.

Definition at line 445 of file CglProbing.hpp.

CliqueEntry* CglProbing::cliqueRow_
private

For each column with nonzero in row copy this gives a clique "number".

So first clique mentioned in row is always 0. If no entries for row then no cliques. If sequence > numberColumns then not in clique.

Definition at line 450 of file CglProbing.hpp.

int* CglProbing::cliqueRowStart_
private

cliqueRow_ starts for each row

Definition at line 452 of file CglProbing.hpp.

char* CglProbing::tightenBounds_
private

If not null and [i] !=0 then also tighten even if continuous.

Definition at line 454 of file CglProbing.hpp.


The documentation for this class was generated from the following file: