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