14 #ifndef DECOMP_ALGOC_INCLUDED
15 #define DECOMP_ALGOC_INCLUDED
35 printf(
"\ncut generateInitVars do nothing");
41 double& mostNegReducedCost) {
49 const int maxInnerIter,
50 const int maxOuterIter);
61 int branch(
int branchedOnIndex,
62 double branchedOnValue);
void phaseUpdate(DecompPhase &phase, DecompStatus &status)
Update of the phase for process loop.
DecompAlgoC & operator=(const DecompAlgoC &)
Disable copy constructors.
static const char * m_classTag
void createMasterProblem(DecompVarList &initVars)
Create the master problem (all algorithms must define this function).
int generateInitVars(DecompVarList &initVars)
Generate initial variables for master problem (PC/DC/RC).
int generateVars(const decompStat stat, DecompVarList &newVars, double &mostNegReducedCost)
DecompAlgoC(const DecompAlgoC &)
Disable copy constructors.
void recomposeSolution(const double *solution, double *rsolution)
Compose solution in x-space from current space.
Class for DECOMP algorithm Cutting Plane Method.
DecompAlgoC(DecompApp *app)
virtual DecompStatus solutionUpdate(const DecompPhase phase, const bool resolve=true, const int maxInnerIter=COIN_INT_MAX, const int maxOuterIter=COIN_INT_MAX)
Update of the solution vectors (primal and/or dual).
int branch(int branchedOnIndex, double branchedOnValue)
Base class for DECOMP algorithms.
std::list< DecompVar * > DecompVarList
The main application class.