83 BCP_tm_user::pack_cut_algo(cut, buf);
89 return BCP_tm_user::unpack_cut_algo(buf);
124 BCP_pricing_status& pricing_status);
149 return BCP_tm_user::compare_tree_nodes(node0, node1);
virtual void pack_module_data(BCP_buffer &buf, BCP_process_t ptype)
Pack the initial information (info that the user wants to send over) for the process specified by the...
virtual void pack_cut_algo(const BCP_cut_algo *cut, BCP_buffer &buf)
Pack an algorithmic cut.
virtual BCP_cut_algo * unpack_cut_algo(BCP_buffer &buf)
Unpack an algorithmic cut.
This is the class from which the user should derive her own algorithmic cuts.
BCP_process_t
This enumerative constant describes the various process types.
BCP_parameter_set< CSP_tm_par > tm_par
virtual BCP_var_algo * unpack_var_algo(BCP_buffer &buf)
Unpack an algorithmic variable.
virtual void init_new_phase(int phase, BCP_column_generation &colgen)
Do whatever initialization is necessary before the phase-th phase.
virtual bool compare_tree_nodes(const BCP_tm_node *node0, const BCP_tm_node *node1)
BCP_parameter_set< CSP_lp_par > lp_par
virtual BCP_solution * unpack_feasible_solution(BCP_buffer &buf)
Unpack a MIP feasible solution that was packed by the BCP_lp_user::pack_feasible_solution() method...
virtual void create_root(BCP_vec< BCP_var * > &added_vars, BCP_vec< BCP_cut * > &added_cuts, BCP_user_data *&user_data, BCP_pricing_status &pricing_status)
Create the set of extra variables and cuts that should be added to the formulation in the root node...
virtual void pack_var_algo(const BCP_var_algo *var, BCP_buffer &buf)
Pack an algorithmic variable.
This is the class from which the user should derive her own algorithmic variables.
This class describes the message buffer used for all processes of BCP.
static BCP_var_algo * CSP_var_unpack(BCP_buffer &buf)
static void CSP_var_pack(const BCP_var_algo *var, BCP_buffer &buf)
virtual BCP_solution * unpack_feasible_solution(BCP_buffer &buf)
Unpack a MIP feasible solution that was packed by the BCP_lp_user::pack_feasible_solution() method...
BCP_column_generation
This enumerative constant describes what to do when a search tree node becomes fathomable for the cur...
The BCP_tm_user class is the base class from which the user can derive a problem specific class to be...
virtual void initialize_core(BCP_vec< BCP_var_core * > &vars, BCP_vec< BCP_cut_core * > &cuts, BCP_lp_relax *&matrix)
Create the core of the problem by filling out the last three arguments.
An object of type BCP_lp_relax holds the description of an lp relaxation.
virtual void display_feasible_solution(const BCP_solution *sol)
Display a feasible solution.
This is the abstract base class for a solution to a Mixed Integer Programming problem.