62 BCP_pricing_status& pricing_status);
BCP_cut_algo * unpack_cut_algo(BCP_buffer &buf)
Unpack an algorithmic cut.
void pack_cut_algo(const BCP_cut_algo *cut, BCP_buffer &buf)
BCP_parameter_set< MC_tm_par > tm_par
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< MC_lp_par > lp_par
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...
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...
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)
void display_feasible_solution(const BCP_solution *sol)
Display a feasible solution.
This class describes the message buffer used for all processes of BCP.
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.
The BCP_tm_user class is the base class from which the user can derive a problem specific class to be...
void display_solution(const BCP_solution *soln)
An object of type BCP_lp_relax holds the description of an lp relaxation.
This is the abstract base class for a solution to a Mixed Integer Programming problem.