19 double lbound, ubound;
35 buf.
pack(OsiRowCut::lb())
36 .
pack(OsiRowCut::ub());
37 const CoinPackedVector& v = OsiRowCut::row();
38 const int numElem = v.getNumElements();
39 buf.
pack(v.getIndices(), numElem)
40 .
pack(v.getElements(), numElem);
55 double* elements = NULL;
56 buf.
unpack(indices, numElem,
true)
57 .
unpack(elements, numElem,
true);
58 OsiRowCut::setRow(numElem, indices, elements);
void pack(BCP_buffer &buf) const
Packing cut to a buffer.
BCP_buffer & pack(const T &value)
Pack a single object of type T.
BCP_buffer & unpack(T &value)
Unpack a single object of type T.
BB_cut(BCP_buffer &buf)
Constructor from content of buffer.
This is the class from which the user should derive her own algorithmic cuts.
When doing a sprint sort of algorithm on the cuts (i.e., leave out a number of cuts at the beginning ...
double ub() const
Return the upper bound on the cut.
double lb() const
Return the lower bound on the cut.
void pack(BCP_buffer &buf) const
Packing cut to a buffer.
Simple representation of a cut by storing non zero coefficients only.
static BCP_MemPool memPool
This class describes the message buffer used for all processes of BCP.
void change_bounds(const double lb, const double ub)
Change just the lower/upper bounds.
static BCP_MemPool memPool