MCF1_tm Class Reference

#include <MCF1_tm.hpp>

Inheritance diagram for MCF1_tm:

Collaboration diagram for MCF1_tm:

Public Member Functions
	MCF1_tm ()
virtual	~MCF1_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 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	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.
Public Attributes
BCP_parameter_set< MCF1_par >	par
MCF1_data	data

Detailed Description

Definition at line 11 of file MCF1_tm.hpp.

Constructor & Destructor Documentation

MCF1_tm::MCF1_tm ( ) [inline]

Definition at line 18 of file MCF1_tm.hpp.

virtual MCF1_tm::~MCF1_tm ( ) [inline, virtual]

Definition at line 19 of file MCF1_tm.hpp.

Member Function Documentation

virtual void MCF1_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 void MCF1_tm::pack_var_algo	(	const BCP_var_algo *	var,
		BCP_buffer &	buf
	)			`[inline, virtual]`

Pack an algorithmic variable.

Reimplemented from BCP_tm_user.

Definition at line 22 of file MCF1_tm.hpp.

virtual BCP_var_algo* MCF1_tm::unpack_var_algo ( BCP_buffer & buf ) [inline, virtual]

Unpack an algorithmic variable.

Reimplemented from BCP_tm_user.

Definition at line 25 of file MCF1_tm.hpp.

virtual void MCF1_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 MCF1_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, there is no user data and no pricing should be done.

Reimplemented from BCP_tm_user.

virtual void MCF1_tm::display_feasible_solution ( const BCP_solution * sol ) [virtual]

Display a feasible solution.

Reimplemented from BCP_tm_user.