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