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