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