60 inline const int *
when()
const
virtual void resolve()
Resolve an LP relaxation after problem modification.
int getAlgorithm() const
Say whether to just count usage.
CbcSolver2 & operator=(const CbcSolver2 &rhs)
Assignment operator.
void initialize(CbcModel *model, const char *keep)
Setup arrays - ones in keep will always be in.
int * node_
Node number when variable last in problem.
int getStrategy() const
Strategy.
int getMemory() const
Get memory (i.e. how recent use should be)
Abstract Base Class for describing an interface to a solver.
CbcModel * model_
Pointer back to model.
CbcSolver2()
Default Constructor.
void setMemory(int value)
Set memory (i.e. how recent use should be)
void setStrategy(int value)
Strategy.
const int * when() const
get which ones have been used
int memory_
How recently it must have been used.
int algorithm_
If 0 nothing, 1 compress and fix, 2 long thin.
int getCount() const
Get current count.
This is to allow the user to replace initialSolve and resolve.
int * howMany_
How many times in problem.
void setAlgorithm(int value)
Say whether to just count usage.
virtual ~CbcSolver2()
Destructor.
Simple Branch and bound class.
virtual OsiSolverInterface * clone(bool CopyData=true) const
Clone.
int strategy_
If 0 get rid of rows, 1 keep rows (to stay dual feasible)
virtual void initialSolve()
Solve initial LP relaxation.