27 const std::string mpdDir );
99 virtual void generateCuts(
const OsiSolverInterface & si, OsiCuts & cs,
116 char * possible=NULL,
117 bool withObjective=
true);
126 int minimumSize=2,
int maximumSize=100);
132 OsiSolverInterface *
cliqueModel(
const OsiSolverInterface * model,
265 void tightenThese(
const OsiSolverInterface & solver,
int number,
const int * which);
301 int probe(
const OsiSolverInterface & si,
302 const OsiRowCutDebugger * debugger,
304 double * colLower,
double * colUpper, CoinPackedMatrix *rowCopy,
305 CoinPackedMatrix *columnCopy,
const CoinBigIndex * rowStartPos,
306 const int * realRow,
const double * rowLower,
const double * rowUpper,
307 const char * intVar,
double * minR,
double * maxR,
int * markR,
311 const OsiRowCutDebugger * debugger,
313 double * colLower,
double * colUpper, CoinPackedMatrix *rowCopy,
314 CoinPackedMatrix *columnCopy,
const int * realRow,
315 double * rowLower,
double * rowUpper,
316 char * intVar,
double * minR,
double * maxR,
int * markR,
320 const OsiRowCutDebugger * debugger,
322 double * colLower,
double * colUpper, CoinPackedMatrix *rowCopy,
323 CoinPackedMatrix *columnCopy,
324 double * rowLower,
double * rowUpper,
325 char * intVar,
double * minR,
double * maxR,
int * markR,
331 double * rowLower,
double * rowUpper,
332 double * colLower,
double * colUpper,
338 int tighten(
double *colLower,
double * colUpper,
339 const int *column,
const double *rowElements,
340 const CoinBigIndex *rowStart,
const CoinBigIndex * rowStartPos,
341 const int * rowLength,
342 double *rowLower,
double *rowUpper,
343 int nRows,
int nCols,
char * intVar,
int maxpass,
347 const int *column,
const double *rowElements,
348 const CoinBigIndex *rowStart,
349 const int * rowLength,
350 double *rowLower,
double *rowUpper,
351 double * minR,
double * maxR,
int * markR,
468{ assert ((dis.
affected&0x80000000)!=0);
return true;}
473{
return (dis.
affected&0x40000000)!=0;}
477{
return (dis.
affected&0x20000000)!=0;}
488 const std::string mpdDir );
499 virtual void generateCuts(
const OsiSolverInterface & si, OsiCuts & cs,
void setZeroOneInDisaggregation(disaggregationAction &dis, bool zeroOne)
void CglProbingUnitTest(const OsiSolverInterface *siP, const std::string mpdDir)
A function that tests the methods in the CglProbing class.
void setAffectedToUBInDisaggregation(disaggregationAction &dis, bool affectedToUB)
bool affectedToUBInDisaggregation(const disaggregationAction &dis)
int affectedInDisaggregation(const disaggregationAction &dis)
void setAffectedInDisaggregation(disaggregationAction &dis, int affected)
void setWhenAtUBInDisaggregation(disaggregationAction &dis, bool whenAtUB)
bool zeroOneInDisaggregation(const disaggregationAction &dis)
bool whenAtUBInDisaggregation(const disaggregationAction &dis)
Cut Generator Base Class.
This just uses implication info
CglImplication(const CglImplication &)
Copy constructor.
virtual void generateCuts(const OsiSolverInterface &si, OsiCuts &cs, const CglTreeInfo info=CglTreeInfo())
Generate cuts from implication table Insert generated cuts into the cut set cs.
virtual ~CglImplication()
Destructor.
CglImplication & operator=(const CglImplication &rhs)
Assignment operator.
CglTreeProbingInfo * probingInfo_
Pointer to tree probing info.
CglImplication()
Default constructor.
CglImplication(CglTreeProbingInfo *info)
Constructor with info.
virtual CglCutGenerator * clone() const
Clone.
void setProbingInfo(CglTreeProbingInfo *info)
Set implication.
virtual std::string generateCpp(FILE *fp)
Create C++ lines to get to current state.
Probing Cut Generator Class.
CglProbing(const CglProbing &)
Copy constructor.
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)
int getMaxPass() const
Get maximum number of passes per node.
double * colUpper_
Upper bounds on columns.
disaggregation * cutVector_
void setMaxProbe(int value)
Set maximum number of unsatisfied variables to look at.
int getMaxProbe() const
Get maximum number of unsatisfied variables to look at.
CliqueType * cliqueType_
Clique type.
int getLogLevel() const
Get log level.
int maxElementsRoot_
Maximum number of elements in row for scan at root.
void deleteCliques()
Delete all clique information.
const double * tightLower() const
Lower.
const char * tightenBounds() const
Array which says tighten continuous.
int maxProbe_
Maximum number of unsatisfied variables to probe.
int * endFixStart_
End of fixes for a column.
int getMaxElements() const
Get maximum number of elements in row for it to be considered.
virtual void refreshSolver(OsiSolverInterface *solver)
This can be used to refresh any inforamtion.
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)
int getMaxPassRoot() const
Get maximum number of passes per node (root node)
const double * tightUpper() const
Upper.
int rowCuts_
Row cuts flag 0 no cuts, 1 just disaggregation type, 2 coefficient ( 3 both), 4 just column cuts -n a...
double * rowLower_
Lower bounds on rows.
void setMaxProbeRoot(int value)
Set maximum number of unsatisfied variables to look at (root node)
friend void CglProbingUnitTest(const OsiSolverInterface *siP, const std::string mpdDir)
A function that tests the methods in the CglProbing class.
int getMaxElementsRoot() const
Get maximum number of elements in row for it to be considered (root node)
virtual std::string generateCpp(FILE *fp)
Create C++ lines to get to current state.
int number01Integers_
Number of 0-1 integer variables.
CoinPackedMatrix * rowCopy_
Row copy (only if snapshot)
int maxPass_
Maximum number of passes to do in probing.
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.
int * zeroFixStart_
Start of zeroFixes cliques for a column in matrix or -1 if not in any clique.
int maxElements_
Maximum number of elements in row for scan.
void setMaxLookRoot(int value)
Set maximum number of variables to look at in one probe (root node)
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.
int generateCutsAndModify(const OsiSolverInterface &si, OsiCuts &cs, CglTreeInfo *info)
int maxStackRoot_
Maximum number of variables to look at in one probe at root.
CglProbing()
Default constructor.
struct CglProbing::disaggregation_struct_tag disaggregation
Disaggregation cuts and for building cliques.
double * colLower_
Lower bounds on columns.
void setLogLevel(int value)
Set log level - 0 none, 1 - a bit, 2 - more details.
CliqueType * cliqueType() const
Clique type.
int getMaxProbeRoot() const
Get maximum number of unsatisfied variables to look at (root node)
virtual CglCutGenerator * clone() const
Clone.
int numberRows_
Number of rows in snapshot (or when cliqueRow stuff computed)
CliqueEntry * cliqueRow_
For each column with nonzero in row copy this gives a clique "number".
void setMaxLook(int value)
Set maximum number of variables to look at in one probe.
int numberIntegers_
Number of integer variables.
void setRowCuts(int type)
Set 0 no cuts, 1 just disaggregation type, 2 coefficient ( 3 both)
void setUsingObjective(int yesNo)
Set 0 don't 1 do -1 don't even think about it.
void tightenThese(const OsiSolverInterface &solver, int number, const int *which)
Mark variables to be tightened.
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 g...
void setMaxElements(int value)
Set maximum number of elements in row for it to be considered.
int mode_
Mode - 0 lazy using snapshot, 1 just unsatisfied, 2 all.
int * cliqueRowStart_
cliqueRow_ starts for each row
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.
CglProbing & operator=(const CglProbing &rhs)
Assignment operator.
CoinPackedMatrix * columnCopy_
Column copy (only if snapshot)
int numberCliques_
Cliques Number of cliques.
double primalTolerance_
Tolerance to see if infeasible.
int logLevel_
Log level - 0 none, 1 - a bit, 2 - more details.
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.
char * tightenBounds_
If not null and [i] !=0 then also tighten even if continuous.
virtual bool mayGenerateRowCutsInTree() const
Returns true if may generate Row cuts in tree (rather than root node).
int numberCliques() const
Number of cliques.
double * rowUpper_
Upper bounds on rows.
int getMaxLook() const
Get maximum number of variables to look at in one probe.
void setupRowCliqueInformation(const OsiSolverInterface &si)
Sets up clique information for each row.
int * oneFixStart_
Start of oneFixes cliques for a column in matrix or -1 if not in any clique.
void setMode(int mode)
Set.
int totalTimesCalled_
Total number of times called.
int maxProbeRoot_
Maximum number of unsatisfied variables to probe at root.
CoinBigIndex * cliqueStart_
Start of each clique.
virtual ~CglProbing()
Destructor.
int maxStack_
Maximum number of variables to look at in one probe.
int numberThisTime_
Number looked at this time.
void setMaxPass(int value)
Set maximum number of passes per node.
int numberColumns_
Number of columns in problem ( must == current)
int createCliques(OsiSolverInterface &si, int minimumSize=2, int maximumSize=100)
Creates cliques for use by probing.
const int * lookedAt() const
Which ones looked at this time.
int getUsingObjective() const
Get.
void setMaxPassRoot(int value)
Set maximum number of passes per node (root node)
int numberThisTime() const
Number looked at this time.
int maxPassRoot_
Maximum number of passes to do in probing at root.
void deleteSnapshot()
Deletes snapshot.
virtual void generateCuts(const OsiSolverInterface &si, OsiCuts &cs, const CglTreeInfo info=CglTreeInfo())
Generate probing/disaggregation cuts for the model of the solver interface, si.
OsiSolverInterface * 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...
int * whichClique_
Clique numbers for one or zero fixes.
const double * relaxedRowUpper() const
Upper.
CoinBigIndex * cliqueStart() const
Start of each clique.
int * lookedAt_
Which ones looked at this time.
const double * relaxedRowLower() const
Lower.
int getMaxLookRoot() const
Get maximum number of variables to look at in one probe (root node)
CliqueEntry * cliqueEntry() const
Entries for clique.
CliqueEntry * cliqueEntry_
Entries for clique.
void setMaxElementsRoot(int value)
Set maximum number of elements in row for it to be considered (root node)
int usingObjective_
Whether to include objective as constraint.
Information about where the cut generator is invoked from.
Disaggregation cuts and for building cliques.
disaggregationAction * index
Derived class to pick up probing info.
Only useful type of disaggregation is most normal For now just done for 0-1 variables Can be used for...