11#ifndef COUENNE_DISJUNCTIVE_CUTS_HPP
12#define COUENNE_DISJUNCTIVE_CUTS_HPP
28class CouenneCutGenerator;
100 bool is_strong =
false,
122#if CGL_VERSION_MAJOR == 0 && CGL_VERSION_MINOR <= 57
196 register double *inverted) {
198 while (n--) *inverted++ = - *orig++;
206 register int displacement) {
208 *dst++ = *src++ + displacement;
Cut Generator for linear convexifications.
Cut Generator for linear convexifications.
bool addPreviousCut_
add previous disj cut to current CGLP?
double cpuTime_
maximum CPU time
~CouenneDisjCuts()
destructor
int depthStopSeparate_
Depth of the BB tree where stop separation.
JnlstPtr jnlst_
SmartPointer to the Journalist.
void OsiSI2MatrVec(CoinPackedMatrix &M, CoinPackedVector &r, OsiSolverInterface &si) const
OsiCuts * getSingleDisjunction(OsiSolverInterface &si) const
create single osicolcut disjunction
bool activeRows_
only include active rows in CGLP
int initDisjNumber_
Initial number of objects to use for generating cuts.
double septime_
separation time (includes generation of problem)
int ntotalcuts_
total number of cuts generated
CouenneCutGenerator * couenneCG() const
return pointer to symbolic problem
int getDisjunctions(std::vector< std::pair< OsiCuts *, OsiCuts * > > &disjunctions, OsiSolverInterface &si, OsiCuts &cs, const CglTreeInfo &info) const
get all disjunctions
int separateWithDisjunction(OsiCuts *cuts, OsiSolverInterface &si, OsiCuts &cs, const CglTreeInfo &info) const
separate couenne cuts on both sides of single disjunction
CouenneCutGenerator * couenneCG_
pointer to symbolic repr. of constraint, variables, and bounds
int depthLevelling_
Depth of the BB tree where start decreasing number of objects.
void generateCuts(const OsiSolverInterface &, OsiCuts &, const CglTreeInfo=CglTreeInfo()) const
the main CglCutGenerator
void applyColCuts(OsiSolverInterface &si, OsiCuts *cuts) const
our own applyColCuts
int generateDisjCuts(std::vector< std::pair< OsiCuts *, OsiCuts * > > &disjs, OsiSolverInterface &si, OsiCuts &cs, const CglTreeInfo &info) const
generate one disjunctive cut from one CGLP
int OsiCuts2MatrVec(OsiSolverInterface *cglp, OsiCuts *cuts, int displRow, int displRhs) const
add CGLP columns to solver interface; return number of columns added (for later removal)
CouenneDisjCuts(const CouenneDisjCuts &)
copy constructor
void mergeBoxes(int dir, CoinPackedVector &left, CoinPackedVector &right, CoinPackedVector merged) const
utility to merge vectors into one
int checkDisjSide(OsiSolverInterface &si, OsiCuts *cuts) const
check if (column!) cuts compatible with solver interface
int numDisjunctions_
Number of disjunction to consider at each separation.
void applyColCuts(OsiSolverInterface &si, OsiColCut *cut) const
our own applyColCut, single cut
ConstJnlstPtr Jnlst() const
Provide Journalist.
OsiChooseVariable * branchingMethod_
Branching scheme (if strong, we can use SB candidates)
int getBoxUnion(OsiSolverInterface &si, OsiCuts *left, OsiCuts *right, CoinPackedVector &lower, CoinPackedVector &upper) const
compute smallest box containing both left and right boxes.
Bonmin::OsiTMINLPInterface * minlp_
nonlinear solver interface as used within Bonmin (used at first Couenne pass of each b&b node)
static void registerOptions(Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions)
Add list of options to be read from file.
double objValue_
Record obj value at final point of CouenneConv.
bool isBranchingStrong_
Is branchMethod_ referred to a strong branching scheme?
double initDisjPercentage_
Initial percentage of objects to use for generating cuts, in [0,1].
CouenneDisjCuts(Bonmin::OsiTMINLPInterface *minlp=NULL, Bonmin::BabSetupBase *base=NULL, CouenneCutGenerator *cg=NULL, OsiChooseVariable *bcv=NULL, bool is_strong=false, JnlstPtr journalist=NULL, const Ipopt::SmartPtr< Ipopt::OptionsList > options=NULL)
constructor
bool activeCols_
only include active columns in CGLP
CouenneDisjCuts * clone() const
clone method (necessary for the abstract CglCutGenerator class)
int nrootcuts_
number of cuts generated at the first call
general include file for different compilers
void CoinCopyDisp(register const int *src, register int num, register int *dst, register int displacement)
a CoinCopyN with a += on each element
void CoinInvN(register const double *orig, register int n, register double *inverted)
invert all contents
SmartPtr< const U > ConstPtr(const SmartPtr< U > &smart_ptr)