Cbc
2.10.10
|
This is to allow the user to replace initialSolve and resolve. More...
#include <CbcSolverLongThin.hpp>
Public Member Functions | |
Solve methods | |
virtual void | initialSolve () |
Solve initial LP relaxation. More... | |
virtual void | resolve () |
Resolve an LP relaxation after problem modification. More... | |
Constructors and destructors | |
CbcSolverLongThin () | |
Default Constructor. More... | |
virtual OsiSolverInterface * | clone (bool CopyData=true) const |
Clone. More... | |
CbcSolverLongThin (const CbcSolverLongThin &) | |
Copy constructor. More... | |
CbcSolverLongThin & | operator= (const CbcSolverLongThin &rhs) |
Assignment operator. More... | |
virtual | ~CbcSolverLongThin () |
Destructor. More... | |
Sets and Getss | |
void | initialize (CbcModel *model, const char *keep) |
Setup arrays - ones in keep will always be in. More... | |
const int * | when () const |
get which ones have been used More... | |
int | getMemory () const |
Get memory (i.e. how recent use should be) More... | |
int | getCount () const |
Get current count. More... | |
void | setMemory (int value) |
Set memory (i.e. how recent use should be) More... | |
void | setBelieveInfeasible (bool yesNo) |
Say whether to believe infeasible. More... | |
void | setAlgorithm (int value) |
Say whether to just count usage. More... | |
void | setNested (double value) |
Do nested search if this fraction fixed. More... | |
int | getAlgorithm () const |
Say whether to just count usage. More... | |
double | getNested () const |
Do nested search if this fraction fixed. More... | |
Private Attributes | |
Private member data | |
double | nestedSearch_ |
Do nested search if this fraction fixed. More... | |
int * | node_ |
Node number when variable last in problem. More... | |
int * | howMany_ |
How many times in problem. More... | |
CbcModel * | model_ |
Pointer back to model. More... | |
int | count_ |
Counter. More... | |
int | memory_ |
How recently it must have been used. More... | |
bool | believeInfeasible_ |
If infeasible on subset means infeasible. More... | |
bool | algorithm_ |
If 0 nothing, 1 compress and fix, 2 long thin. More... | |
This is to allow the user to replace initialSolve and resolve.
Definition at line 18 of file CbcSolverLongThin.hpp.
CbcSolverLongThin::CbcSolverLongThin | ( | ) |
Default Constructor.
CbcSolverLongThin::CbcSolverLongThin | ( | const CbcSolverLongThin & | ) |
Copy constructor.
|
virtual |
Destructor.
|
virtual |
Solve initial LP relaxation.
|
virtual |
Resolve an LP relaxation after problem modification.
|
virtual |
Clone.
CbcSolverLongThin& CbcSolverLongThin::operator= | ( | const CbcSolverLongThin & | rhs | ) |
Assignment operator.
void CbcSolverLongThin::initialize | ( | CbcModel * | model, |
const char * | keep | ||
) |
Setup arrays - ones in keep will always be in.
|
inline |
get which ones have been used
Definition at line 56 of file CbcSolverLongThin.hpp.
|
inline |
Get memory (i.e. how recent use should be)
Definition at line 61 of file CbcSolverLongThin.hpp.
|
inline |
Get current count.
Definition at line 66 of file CbcSolverLongThin.hpp.
|
inline |
Set memory (i.e. how recent use should be)
Definition at line 71 of file CbcSolverLongThin.hpp.
|
inline |
Say whether to believe infeasible.
Definition at line 76 of file CbcSolverLongThin.hpp.
|
inline |
Say whether to just count usage.
Definition at line 81 of file CbcSolverLongThin.hpp.
|
inline |
Do nested search if this fraction fixed.
Definition at line 86 of file CbcSolverLongThin.hpp.
|
inline |
Say whether to just count usage.
Definition at line 91 of file CbcSolverLongThin.hpp.
|
inline |
Do nested search if this fraction fixed.
Definition at line 96 of file CbcSolverLongThin.hpp.
|
private |
Do nested search if this fraction fixed.
Definition at line 108 of file CbcSolverLongThin.hpp.
|
private |
Node number when variable last in problem.
Definition at line 110 of file CbcSolverLongThin.hpp.
|
private |
How many times in problem.
Definition at line 112 of file CbcSolverLongThin.hpp.
|
private |
Pointer back to model.
Definition at line 114 of file CbcSolverLongThin.hpp.
|
private |
Counter.
Definition at line 116 of file CbcSolverLongThin.hpp.
|
private |
How recently it must have been used.
Definition at line 118 of file CbcSolverLongThin.hpp.
|
private |
If infeasible on subset means infeasible.
Definition at line 120 of file CbcSolverLongThin.hpp.
|
private |
If 0 nothing, 1 compress and fix, 2 long thin.
Definition at line 122 of file CbcSolverLongThin.hpp.