Go to the documentation of this file.
9 #include "OsiClpSolverInterface.hpp"
42 virtual OsiSolverInterface *
clone(
bool CopyData =
true)
const;
60 inline const int *
when()
const
void setMemory(int value)
Set memory (i.e. how recent use should be)
int * howMany_
How many times in problem.
int memory_
How recently it must have been used.
int strategy_
If 0 get rid of rows, 1 keep rows (to stay dual feasible)
int getCount() const
Get current count.
virtual void resolve()
Resolve an LP relaxation after problem modification.
virtual void initialSolve()
Solve initial LP relaxation.
virtual ~CbcSolver2()
Destructor.
This is to allow the user to replace initialSolve and resolve.
Simple Branch and bound class.
CbcSolver2 & operator=(const CbcSolver2 &rhs)
Assignment operator.
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 getStrategy() const
Strategy.
int * node_
Node number when variable last in problem.
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.
virtual OsiSolverInterface * clone(bool CopyData=true) const
Clone.
CbcModel * model_
Pointer back to model.
CbcSolver2()
Default Constructor.
void setStrategy(int value)
Strategy.
int algorithm_
If 0 nothing, 1 compress and fix, 2 long thin.