#include <BB_tm.hpp>


Public Member Functions | |
| void | readInput (const char *filename) |
| Read input and set up data in class BB_prob. | |
| virtual void | initialize_core (BCP_vec< BCP_var_core * > &vars, BCP_vec< BCP_cut_core * > &cuts, BCP_lp_relax *&matrix) |
| Pass the core constraints and core variables to 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) |
| Create the root node of the enumeration. | |
| virtual void | display_feasible_solution (const BCP_solution *sol) |
| Print a feasible solution. | |
Constructors and destructors | |
| BB_tm () | |
| Default constructor. | |
| virtual | ~BB_tm () |
| Default destructor. | |
Packing and unpacking methods | |
| virtual void | pack_module_data (BCP_buffer &buf, BCP_process_t ptype) |
| Pack data into a buffer; will not work in parallel environment as it uses pointer. | |
| virtual void | pack_cut_algo (const BCP_cut_algo *cut, BCP_buffer &buf) |
| Packing of algorithmic cuts. | |
| virtual BCP_cut_algo * | unpack_cut_algo (BCP_buffer &buf) |
| Unpacking of algorithmic cuts. | |
| virtual void | pack_user_data (const BCP_user_data *ud, BCP_buffer &buf) |
| Packing of user data. | |
| virtual BCP_user_data * | unpack_user_data (BCP_buffer &buf) |
| Unpacking of user_data. | |
Private Attributes | |
Private data member | |
| BB_prob | desc |
| Pointer to the description of the problem. | |
Definition at line 19 of file BB_tm.hpp.
| virtual BB_tm::~BB_tm | ( | ) | [inline, virtual] |
| void BB_tm::readInput | ( | const char * | filename | ) |
Read input and set up data in class BB_prob.
| virtual void BB_tm::pack_module_data | ( | BCP_buffer & | buf, | |
| BCP_process_t | ptype | |||
| ) | [virtual] |
Pack data into a buffer; will not work in parallel environment as it uses pointer.
Reimplemented from BCP_tm_user.
| virtual void BB_tm::pack_cut_algo | ( | const BCP_cut_algo * | cut, | |
| BCP_buffer & | buf | |||
| ) | [virtual] |
Packing of algorithmic cuts.
Reimplemented from BCP_tm_user.
| virtual BCP_cut_algo* BB_tm::unpack_cut_algo | ( | BCP_buffer & | buf | ) | [virtual] |
Unpacking of algorithmic cuts.
Reimplemented from BCP_tm_user.
| virtual void BB_tm::pack_user_data | ( | const BCP_user_data * | ud, | |
| BCP_buffer & | buf | |||
| ) | [virtual] |
Packing of user data.
Reimplemented from BCP_tm_user.
| virtual BCP_user_data* BB_tm::unpack_user_data | ( | BCP_buffer & | buf | ) | [virtual] |
Unpacking of user_data.
Reimplemented from BCP_tm_user.
| virtual void BB_tm::initialize_core | ( | BCP_vec< BCP_var_core * > & | vars, | |
| BCP_vec< BCP_cut_core * > & | cuts, | |||
| BCP_lp_relax *& | matrix | |||
| ) | [virtual] |
Pass the core constraints and core variables to bcp.
Reimplemented from BCP_tm_user.
| virtual void BB_tm::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] |
Create the root node of the enumeration.
Reimplemented from BCP_tm_user.
| virtual void BB_tm::display_feasible_solution | ( | const BCP_solution * | sol | ) | [virtual] |
Print a feasible solution.
Reimplemented from BCP_tm_user.
BB_prob BB_tm::desc [private] |
1.6.1