35 static inline void *
operator new(
size_t size) {
39 static inline void operator delete(
void *p,
size_t size) {
72 static inline void *
operator new(
size_t size) {
76 static inline void operator delete(
void *p,
size_t size) {
void pack(BCP_buffer &buf) const
Packing cut to a buffer.
int index() const
Constructor from content of buffer.
BB_indexed_cut & operator=(const BB_indexed_cut &)
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.
static BCP_MemPool memPool
double lb() const
Return the lower bound on the cut.
void free(void *p, size_t n)
void pack(BCP_buffer &buf) const
Packing cut to a buffer.
~BB_indexed_cut()
Destructor.
Simple representation of a cut by storing non zero coefficients only.
This class describes the message buffer used for all processes of BCP.
static BCP_MemPool memPool