#include <CbcSolver2.hpp>
Public Member Functions | |
Solve methods | |
virtual void | initialSolve () |
Solve initial LP relaxation. | |
virtual void | resolve () |
Resolve an LP relaxation after problem modification. | |
Constructors and destructors | |
CbcSolver2 () | |
Default Constructor. | |
virtual OsiSolverInterface * | clone (bool CopyData=true) const |
Clone. | |
CbcSolver2 (const CbcSolver2 &) | |
Copy constructor. | |
CbcSolver2 & | operator= (const CbcSolver2 &rhs) |
Assignment operator. | |
virtual | ~CbcSolver2 () |
Destructor. | |
Sets and Getss | |
void | initialize (CbcModel *model, const char *keep) |
Setup arrays - ones in keep will always be in. | |
const int * | when () const |
get which ones have been used | |
int | getMemory () const |
Get memory (i.e. how recent use should be). | |
int | getCount () const |
Get current count. | |
void | setMemory (int value) |
Set memory (i.e. how recent use should be). | |
void | setAlgorithm (int value) |
Say whether to just count usage. | |
int | getAlgorithm () const |
Say whether to just count usage. | |
void | setStrategy (int value) |
Strategy. | |
int | getStrategy () const |
Strategy. | |
Private Attributes | |
Private member data | |
int * | node_ |
Node number when variable last in problem. | |
int * | howMany_ |
How many times in problem. | |
CbcModel * | model_ |
Pointer back to model. | |
int | count_ |
Counter. | |
int | memory_ |
How recently it must have been used. | |
int | algorithm_ |
If 0 nothing, 1 compress and fix, 2 long thin. | |
int | strategy_ |
If 0 get rid of rows, 1 keep rows (to stay dual feasible). |
This version is to try and speed up long thin problems.
This particular version assumes unit elements and rhs Can be E or G rhs
Definition at line 20 of file CbcSolver2.hpp.
|
Default Constructor.
|
|
Copy constructor.
|
|
Destructor.
|
|
Solve initial LP relaxation.
|
|
Resolve an LP relaxation after problem modification.
|
|
Clone.
|
|
Assignment operator.
|
|
Setup arrays - ones in keep will always be in.
|
|
get which ones have been used
Definition at line 60 of file CbcSolver2.hpp. |
|
Get memory (i.e. how recent use should be).
Definition at line 63 of file CbcSolver2.hpp. |
|
Get current count.
Definition at line 66 of file CbcSolver2.hpp. |
|
Set memory (i.e. how recent use should be).
Definition at line 69 of file CbcSolver2.hpp. References memory_. |
|
Say whether to just count usage.
Definition at line 72 of file CbcSolver2.hpp. References algorithm_. |
|
Say whether to just count usage.
Definition at line 75 of file CbcSolver2.hpp. |
|
Strategy.
Definition at line 78 of file CbcSolver2.hpp. References strategy_. |
|
Strategy.
Definition at line 81 of file CbcSolver2.hpp. |
|
Node number when variable last in problem.
Definition at line 92 of file CbcSolver2.hpp. |
|
How many times in problem.
Definition at line 94 of file CbcSolver2.hpp. |
|
Pointer back to model.
Definition at line 96 of file CbcSolver2.hpp. |
|
Counter.
Definition at line 98 of file CbcSolver2.hpp. |
|
How recently it must have been used.
Definition at line 100 of file CbcSolver2.hpp. Referenced by setMemory(). |
|
If 0 nothing, 1 compress and fix, 2 long thin.
Definition at line 102 of file CbcSolver2.hpp. Referenced by setAlgorithm(). |
|
If 0 get rid of rows, 1 keep rows (to stay dual feasible).
Definition at line 104 of file CbcSolver2.hpp. Referenced by setStrategy(). |