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