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