56 inline const int *
when()
const
double nestedSearch_
Do nested search if this fraction fixed.
CbcModel * model_
Pointer back to model.
int getCount() const
Get current count.
virtual OsiSolverInterface * clone(bool CopyData=true) const
Clone.
CbcSolver3 & operator=(const CbcSolver3 &rhs)
Assignment operator.
virtual ~CbcSolver3()
Destructor.
void setNested(double value)
Do nested search if this fraction fixed.
This is to allow the user to replace initialSolve and resolve.
virtual void initialSolve()
Solve initial LP relaxation.
bool believeInfeasible_
If infeasible on subset means infeasible.
int * howMany_
How many times in problem.
void setMemory(int value)
Set memory (i.e. how recent use should be)
void setBelieveInfeasible(bool yesNo)
Say whether to believe infeasible.
int memory_
How recently it must have been used.
double getNested() const
Do nested search if this fraction fixed.
Abstract Base Class for describing an interface to a solver.
void initialize(CbcModel *model, const char *keep)
Setup arrays - ones in keep will always be in.
void setAlgorithm(int value)
Say whether to just count usage.
int * node_
Node number when variable last in problem.
virtual void resolve()
Resolve an LP relaxation after problem modification.
int getAlgorithm() const
Say whether to just count usage.
int getMemory() const
Get memory (i.e. how recent use should be)
bool algorithm_
If 0 nothing, 1 compress and fix, 2 long thin.
Simple Branch and bound class.
const int * when() const
get which ones have been used
CbcSolver3()
Default Constructor.