virtual void unpack_module_data(BCP_buffer &buf)
Unpack the initial information sent to the Variable Generator process by the Tree Manager.
BCP_vg_prob * getVgProblemPointer()
Get the pointer.
virtual void generate_vars(BCP_vec< BCP_cut * > &cuts, BCP_vec< double > &pi)
Perform the actual variable generation.
The BCP_vg_user class is the base class from which the user can derive a problem specific class to be...
double upper_bound() const
Return what is the best known upper bound (might be BCP_DBL_MAX)
void send_var(const BCP_var &var)
Pack the argument into the message buffer and send it to the sender of the LP solution.
virtual void unpack_dual_solution(BCP_buffer &buf)
Unpack the LP solution arriving from the LP process.
This class is a very simple impelementation of a constant length string.
This is the class from which the user should derive her own algorithmic variables.
Abstract base class that defines members common to all types of cuts.
virtual ~BCP_vg_user()
Being virtual, the destructor invokes the destructor for the real type of the object being deleted.
int current_phase() const
Return the phase the algorithm is in.
void setVgProblemPointer(BCP_vg_prob *ptr)
Set the pointer.
This class is the central class of the Variable Generator process.
int current_iteration() const
Return the iteration count within the search tree node for which cuts are being generated.
int current_index() const
Return the internal index of the search tree node for which cuts are being generated.
Abstract base class that defines members common to all types of variables.
int current_level() const
Return the level of the search tree node for which cuts are being generated.
void set_param(const BCP_vg_par::chr_params key, const bool val)
This class describes the message buffer used for all processes of BCP.
char get_param(const BCP_vg_par::chr_params key) const
This is the class from which the user should derive her own algorithmic cuts.