65 BCP_pricing_status& pricing_status);
virtual void display_feasible_solution(const BCP_solution *soln)
Display a feasible solution.
BCP_process_t
This enumerative constant describes the various process types.
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...
BCP_parameter_set< MKC_tm_par > tm_par
virtual void init_new_phase(int phase, BCP_column_generation &colgen)
virtual void pack_var_algo(const BCP_var_algo *var, BCP_buffer &buf)
OsiClpSolverInterface * clp
BCP_parameter_set< MKC_lp_par > lp_par
BCP_vec< MKC_var * > input_vars
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.
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)
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...
void purge_ptr_vector(BCP_vec< T * > &pvec, typename BCP_vec< T * >::iterator first, typename BCP_vec< T * >::iterator last)
This function purges the entries [first,last) from the vector of pointers pvec.
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.
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 BCP_var_algo * unpack_var_algo(BCP_buffer &buf)
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.