3#ifndef _BCP_TMSTORAGE_H
4#define _BCP_TMSTORAGE_H
79 BCP_ts_prob(
const BCP_ts_prob&);
81 BCP_ts_prob& operator=(
const BCP_ts_prob&);
102 std::map<int, BCP_ts_node_data*>
nodes;
104 std::map<int, BCP_var_algo*>
vars;
106 std::map<int, BCP_cut_algo*>
cuts;
144 return p->par.entry(key); }
146 return p->par.entry(key); }
148 return p->par.entry(key); }
150 return p->par.entry(key); }
153 p->par.set_entry(key, val); }
155 p->par.set_entry(key, val); }
157 p->par.set_entry(key, val); }
159 p->par.set_entry(key, val); }
161 p->par.set_entry(key, val); }
This class describes the message buffer used for all processes of BCP.
This is the class from which the user should derive her own algorithmic cuts.
This is an abstract base class that describes the message passing environment.
This is the class serves as a holder for a set of parameters.
This class describes the core of the MIP problem, the variables/cuts in it as well as the matrix corr...
BCP_process(int self, int my_parent)
This class is a very simple impelementation of a constant length string.
std::map< int, BCP_ts_node_data * > nodes
BCP_message_environment * msg_env
BCP_parameter_set< BCP_ts_par > par
BCP_ts_prob(int my_id, int parent)
virtual BCP_buffer & get_message_buffer()
std::map< int, BCP_var_algo * > vars
BCP_vec< int > indices
a list of indices of nodes/vars/cuts that are requested/tobe deleted
std::map< int, BCP_cut_algo * > cuts
BCP_vec< int > positions
positions in the TM of requested nodes/vars/cuts
virtual void process_message()
void set_param(const BCP_ts_par::str_params key, const char *val)
void set_param(const BCP_ts_par::chr_params key, const bool val)
BCP_ts_prob * getTsProblemPointer()
Get the pointer.
void set_param(const BCP_ts_par::int_params key, const int val)
void setTsProblemPointer(BCP_ts_prob *ptr)
Set the pointer.
int get_param(const BCP_ts_par::int_params key) const
virtual void unpack_module_data(BCP_buffer &buf)
Unpack the initial information sent to the LP process by the Tree Manager.
virtual ~BCP_ts_user()
Being virtual, the destructor invokes the destructor for the real type of the object being deleted.
void set_param(const BCP_ts_par::chr_params key, const char val)
const BCP_string & get_param(const BCP_ts_par::str_params key) const
void set_param(const BCP_ts_par::dbl_params key, const double val)
double get_param(const BCP_ts_par::dbl_params key) const
char get_param(const BCP_ts_par::chr_params key) const
This is the class from which the user should derive her own algorithmic variables.
The class BCP_vec serves the same purpose as the vector class in the standard template library.
Same as BCP_tm_node_data, just there's no need to use smart pointers in this process.
@ end_of_str_array_params
@ MaxHeapSize
The maximum size of the memory heap the TS can use.