#include <CSP_tm.hpp>
Inheritance diagram for CSP_tm:
Public Member Functions | |
CSP_tm () | |
~CSP_tm () | |
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 last argument. | |
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 | pack_var_algo (const BCP_var_algo *var, BCP_buffer &buf) |
Pack an algorithmic variable. | |
virtual BCP_var_algo * | unpack_var_algo (BCP_buffer &buf) |
Unpack an algorithmic variable. | |
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. | |
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. | |
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 | display_feasible_solution (const BCP_solution *sol) |
Display a feasible solution. | |
virtual void | init_new_phase (int phase, BCP_column_generation &colgen) |
Do whatever initialization is necessary before the phase -th phase. | |
Compare two search tree nodes. Return true if the first node | |
should be processed before the second one.
Default: The default behavior is controlled by the | |
virtual bool | compare_tree_nodes (const BCP_tm_node *node0, const BCP_tm_node *node1) |
Public Attributes | |
BCP_parameter_set< CSP_tm_par > | tm_par |
BCP_parameter_set< CSP_lp_par > | lp_par |
CSPROBLEM * | csproblem |
Definition at line 23 of file CSP_tm.hpp.
CSP_tm::CSP_tm | ( | ) | [inline] |
Definition at line 31 of file CSP_tm.hpp.
CSP_tm::~CSP_tm | ( | ) | [inline] |
virtual void CSP_tm::pack_module_data | ( | BCP_buffer & | buf, | |
BCP_process_t | ptype | |||
) | [virtual] |
Pack the initial information (info that the user wants to send over) for the process specified by the last argument.
The information packed here will be unpacked in the unpack_module_data()
method of the user defined class in the appropriate process.
Default: empty method.
Reimplemented from BCP_tm_user.
virtual BCP_solution* CSP_tm::unpack_feasible_solution | ( | BCP_buffer & | buf | ) | [inline, virtual] |
Unpack a MIP feasible solution that was packed by the BCP_lp_user::pack_feasible_solution() method.
Default: Unpacks a BCP_solution_generic object. The built-in default should be used if and only if the built-in default was used in BCP_lp_user::pack_feasible_solution().
Reimplemented from BCP_tm_user.
Definition at line 62 of file CSP_tm.hpp.
References BCP_tm_user::unpack_feasible_solution().
virtual void CSP_tm::pack_var_algo | ( | const BCP_var_algo * | var, | |
BCP_buffer & | buf | |||
) | [inline, virtual] |
virtual BCP_var_algo* CSP_tm::unpack_var_algo | ( | BCP_buffer & | buf | ) | [inline, virtual] |
Unpack an algorithmic variable.
Definition at line 75 of file CSP_tm.hpp.
References CSP_var_unpack().
virtual void CSP_tm::pack_cut_algo | ( | const BCP_cut_algo * | cut, | |
BCP_buffer & | buf | |||
) | [inline, virtual] |
virtual BCP_cut_algo* CSP_tm::unpack_cut_algo | ( | BCP_buffer & | buf | ) | [inline, virtual] |
virtual void CSP_tm::initialize_core | ( | BCP_vec< BCP_var_core * > & | vars, | |
BCP_vec< BCP_cut_core * > & | cuts, | |||
BCP_lp_relax *& | matrix | |||
) | [virtual] |
Create the core of the problem by filling out the last three arguments.
These variables/cuts will always stay in the LP relaxation and the corresponding matrix is described by the specified matrix. If there is no core variable or cut then the returned pointer for to the matrix should be a null pointer.
Default: empty method, meaning that there are no variables/cuts in the core and this the core matrix is empty (0 pointer) as well.
Reimplemented from BCP_tm_user.
virtual void CSP_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 set of extra variables and cuts that should be added to the formulation in the root node.
Also decide how variable pricing shuld be done, that is, if column generation is requested in the init_new_phase() method of this class then column generation should be performed according to pricing_status
.
Default: empty method, meaning that no variables/cuts are added and no pricing should be done.
virtual void CSP_tm::display_feasible_solution | ( | const BCP_solution * | sol | ) | [virtual] |
virtual void CSP_tm::init_new_phase | ( | int | phase, | |
BCP_column_generation & | colgen | |||
) | [virtual] |
Do whatever initialization is necessary before the phase
-th phase.
(E.g., setting the pricing strategy.)
virtual bool CSP_tm::compare_tree_nodes | ( | const BCP_tm_node * | node0, | |
const BCP_tm_node * | node1 | |||
) | [inline, virtual] |
Definition at line 147 of file CSP_tm.hpp.
Definition at line 25 of file CSP_tm.hpp.
Definition at line 26 of file CSP_tm.hpp.