virtual void init_new_phase(int phase, BCP_column_generation &colgen, CoinSearchTreeBase *&candidates)
Do whatever initialization is necessary before the phase-th phase.
BCP_parameter_set< MCF1_par > par
BCP_var_algo * MCF1_unpack_var(BCP_buffer &buf)
virtual void pack_var_algo(const BCP_var_algo *var, BCP_buffer &buf)
Pack an algorithmic variable.
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...
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.
void MCF1_pack_var(const BCP_var_algo *var, BCP_buffer &buf)
virtual void create_root(BCP_vec< BCP_var * > &added_vars, BCP_vec< BCP_cut * > &added_cuts, BCP_user_data *&user_data)
Create the set of extra variables and cuts that should be added to the formulation in the root node...
virtual BCP_var_algo * unpack_var_algo(BCP_buffer &buf)
Unpack an algorithmic variable.
virtual void display_feasible_solution(const BCP_solution *sol)
Display a feasible solution.
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.
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...
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.