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