10 #include "OsiSolverInterface.hpp" 11 #include "CoinHelperFunctions.hpp" 71 virtual bool fixes(
int ,
int ,
int ,
bool) {
return false;}
106 OsiSolverInterface * analyze(
const OsiSolverInterface & si,
int createSolver=0,
107 int numberExtraCliques=0,
const int * starts=NULL,
108 const CliqueEntry * entries=NULL,
const char * type=NULL);
112 virtual bool fixes(
int variable,
int toValue,
int fixedVariable,
bool fixedToLower);
117 int fixColumns(OsiSolverInterface & si)
const;
119 int fixColumns(
int iColumn,
int value, OsiSolverInterface & si)
const;
123 void generateCuts(
const OsiSolverInterface & si, OsiCuts & cs,
127 { convert();
return fixEntry_;}
130 { convert();
return toZero_;}
133 { convert();
return toOne_;}
136 {
return integerVariable_;}
142 {
return numberVariables_;}
145 {
return numberIntegers_;}
172 {
return cEntry.
fixes&0x7fffffff;}
174 { cEntry.
fixes = sequence|(cEntry.
fixes&0x80000000);}
176 {
return (cEntry.
fixes&0x80000000)!=0;}
178 { cEntry.
fixes = (oneFixes ? 0x80000000 : 0)|(cEntry.
fixes&0x7fffffff);}
int * toZero()
Starts of integer variable going to zero.
OsiRowCut ** strengthenRow
Replacement array.
virtual ~CglTreeInfo()
Destructor.
int options
Options 1 - treat costed integers as important 2 - switch off some stuff as variables semi-integer 4 ...
int * toOne()
Starts of integer variable going to one.
CliqueEntry * fixEntries()
Entries for fixing variables.
int level
The level of the search tree node.
void setSequenceInCliqueEntry(CliqueEntry &cEntry, int sequence)
Stored Cut Generator Class.
Information about where the cut generator is invoked from.
int * toZero_
Starts of integer variable going to zero.
int numberIntegers_
Number of 0-1 variables.
int maximumEntries_
Maximum number in fixEntry_.
int * backward_
Backward look up.
int formulation_rows
The number of rows in the original formulation.
int * integerVariable() const
List of 0-1 integer variables.
bool oneFixesInCliqueEntry(const CliqueEntry &cEntry)
Derived class to pick up probing info.
CliqueEntry * fixEntry_
Entries for fixing variables.
int numberEntries_
Number entries in fixingEntry_ (and fixEntry_) or -2 if correct style.
CglTreeInfo & operator=(const CglTreeInfo &rhs)
Assignment operator.
CglTreeInfo()
Default constructor.
int * integerVariable_
List of 0-1 integer variables.
int numberVariables() const
Number of variables.
int numberVariables_
Number of variables.
int pass
How many times the cut generator was already invoked in this search tree node.
int sequenceInCliqueEntry(const CliqueEntry &cEntry)
bool inTree
Set true if in tree (to avoid ambiguity at first branch)
int * toOne_
Starts of integer variable going to one.
virtual int initializeFixing(const OsiSolverInterface *)
Initalizes fixing arrays etc - returns >0 if we want to save info 0 if we don't and -1 if is to be us...
void setOneFixesInCliqueEntry(CliqueEntry &cEntry, bool oneFixes)
int numberIntegers() const
Number of 0-1 variables.
int * backward() const
Backward look up.
virtual bool fixes(int, int, int, bool)
Take action if cut generator can fix a variable (toValue -1 for down, +1 for up)
int * fixingEntry_
Entries for fixing variable when collecting.
virtual CglTreeInfo * clone() const
Clone.
CoinThreadRandom * randomNumberGenerator
Optional pointer to thread specific random number generator.