BCP_problem_core Class Reference

#include <BCP_problem_core.hpp>

List of all members.

Public Member Functions
Constructors and destructor
	BCP_problem_core ()
	BCP_problem_core (BCP_vec< BCP_var_core * > &v, BCP_vec< BCP_cut_core * > &c, BCP_lp_relax *&m)
	~BCP_problem_core ()
Query methods
size_t	varnum () const
size_t	cutnum () const
Packing and unpacking methods
void	pack (BCP_buffer &buf) const
void	unpack (BCP_buffer &buf)
Public Attributes
Data members
BCP_vec< BCP_var_core * >	vars
BCP_vec< BCP_cut_core * >	cuts
BCP_lp_relax *	matrix
Private Member Functions
Private and disabled methods
void	clear ()
	BCP_problem_core (const BCP_problem_core &)
BCP_problem_core &	operator= (const BCP_problem_core &)

---

Detailed Description

This class describes the core of the MIP problem, the variables/cuts in it as well as the matrix corresponding the core variables and cuts. Core cuts and variables never leave the formulation.

Definition at line 31 of file BCP_problem_core.hpp.

---

Constructor & Destructor Documentation

BCP_problem_core::BCP_problem_core (  const BCP_problem_core &   )  [private]

The copy constructor is declared but not defined to disable it.

BCP_problem_core::BCP_problem_core (   )

The default constructor creates an empty core description: no variables/cuts and an empty matrix. Definition at line 22 of file BCP_problem_core.cpp. : vars(), cuts(), matrix(new BCP_lp_relax(true /*colordered*/)) {}

BCP_problem_core::BCP_problem_core (  BCP_vec< BCP_var_core * > &  v, BCP_vec< BCP_cut_core * > &  c, BCP_lp_relax *&  m )  [inline]

This constructor "takes over" the arguments. The created core description will have the content of the arguments in its data members while the arguments lose their content. Definition at line 65 of file BCP_problem_core.hpp. References cuts, matrix, BCP_vec< BCP_cut_core * >::swap(), BCP_vec< BCP_var_core * >::swap(), and vars. : vars(), cuts(), matrix(m) { vars.swap(v); cuts.swap(c); m = 0; }

BCP_problem_core::~BCP_problem_core (   )

The desctructor deletes all data members. Definition at line 25 of file BCP_problem_core.cpp. References clear(). { clear(); }

---

Member Function Documentation

void BCP_problem_core::clear (   )  [inline, private]

Delete all data members. This method purges the pointer vector members, i.e., deletes the object the pointers in the vectors point to. Definition at line 14 of file BCP_problem_core.cpp. References cuts, matrix, and vars. Referenced by unpack(), and ~BCP_problem_core(). { delete matrix; matrix = 0; purge_ptr_vector(cuts); purge_ptr_vector(vars); }

size_t BCP_problem_core::cutnum (   )  const [inline]

Return the number of cuts in the core. Definition at line 80 of file BCP_problem_core.hpp. References cuts, and BCP_vec< BCP_cut_core * >::size(). Referenced by BCP_problem_core_change::operator=(). { return cuts.size(); }

BCP_problem_core& BCP_problem_core::operator= (  const BCP_problem_core &   )  [private]

The assignment operator is declared but not defined to disable it.

void BCP_problem_core::pack (  BCP_buffer &  buf  )  const

Pack the contents of the core description into the buffer. Definition at line 32 of file BCP_problem_core.cpp. References BCP_cut::bcpind(), BCP_var::bcpind(), BCP_vec< BCP_cut_core * >::begin(), BCP_vec< BCP_var_core * >::begin(), cuts, BCP_vec< BCP_cut_core * >::end(), BCP_vec< BCP_var_core * >::end(), BCP_cut::lb(), BCP_var::lb(), matrix, BCP_var::obj(), BCP_cut_core::obj_type(), BCP_var_core::obj_type(), BCP_lp_relax::pack(), BCP_buffer::pack(), BCP_vec< BCP_cut_core * >::size(), BCP_vec< BCP_var_core * >::size(), BCP_cut::status(), BCP_var::status(), BCP_cut::ub(), BCP_var::ub(), BCP_var::var_type(), and vars. { buf.pack(vars.size()); if (vars.size() > 0) { BCP_vec<BCP_var_core*>::const_iterator vi = vars.begin() - 1; const BCP_vec<BCP_var_core*>::const_iterator lastvi = vars.end(); while (++vi != lastvi) { const BCP_var_core& var = **vi; const int bcpind = var.bcpind(); const BCP_object_t obj_t = var.obj_type(); const BCP_obj_status stat = var.status(); const BCP_var_t var_t = var.var_type(); const double obj = var.obj(); const double lb = var.lb(); const double ub = var.ub(); buf.pack(bcpind) .pack(obj_t).pack(stat).pack(var_t).pack(obj).pack(lb).pack(ub); } } buf.pack(cuts.size()); if (cuts.size() > 0) { BCP_vec<BCP_cut_core*>::const_iterator ci = cuts.begin() - 1; const BCP_vec<BCP_cut_core*>::const_iterator lastci = cuts.end(); while (++ci != lastci) { BCP_cut_core& cut = **ci; const int bcpind = cut.bcpind(); const BCP_object_t obj_t = cut.obj_type(); const BCP_obj_status stat = cut.status(); const double lb = cut.lb(); const double ub = cut.ub(); buf.pack(bcpind).pack(obj_t).pack(stat).pack(lb).pack(ub); } } matrix->pack(buf); }

void BCP_problem_core::unpack (  BCP_buffer &  buf  )

Unpack the contents of the core description from the buffer. Definition at line 72 of file BCP_problem_core.cpp. References clear(), cuts, matrix, BCP_vec< BCP_cut_core * >::reserve(), BCP_vec< BCP_var_core * >::reserve(), BCP_cut::set_bcpind(), BCP_var::set_bcpind(), BCP_cut::set_status(), BCP_var::set_status(), BCP_vec< BCP_cut_core * >::unchecked_push_back(), BCP_vec< BCP_var_core * >::unchecked_push_back(), BCP_lp_relax::unpack(), BCP_buffer::unpack(), and vars. { clear(); size_t size; int bcpind; BCP_object_t obj_t; BCP_obj_status stat; BCP_var_t var_t; double obj; double lb; double ub; buf.unpack(size); if (size > 0) { BCP_var_core* bvar; for (vars.reserve(size); size; --size) { buf.unpack(bcpind) .unpack(obj_t).unpack(stat) .unpack(var_t).unpack(obj).unpack(lb).unpack(ub); bvar = new BCP_var_core(var_t, obj, lb, ub); bvar->set_bcpind(bcpind); bvar->set_status(stat); vars.unchecked_push_back(bvar); } } buf.unpack(size); if (size > 0) { BCP_cut_core* bcut; for (cuts.reserve(size); size; --size) { buf.unpack(bcpind).unpack(obj_t).unpack(stat).unpack(lb).unpack(ub); bcut = new BCP_cut_core(lb, ub); bcut->set_bcpind(bcpind); bcut->set_status(stat); cuts.unchecked_push_back(bcut); } } matrix = new BCP_lp_relax(true /*colordered*/); matrix->unpack(buf); }

size_t BCP_problem_core::varnum (   )  const [inline]

Return the number of variables in the core. Definition at line 78 of file BCP_problem_core.hpp. References BCP_vec< BCP_var_core * >::size(), and vars. Referenced by BCP_problem_core_change::operator=(). { return vars.size(); }

---

Member Data Documentation

BCP_vec<BCP_cut_core*> BCP_problem_core::cuts

A vector of pointers to the cuts in the core of the problem. These are the cuts that always stay in the problem formulation. Definition at line 51 of file BCP_problem_core.hpp. Referenced by BCP_problem_core(), clear(), cutnum(), BCP_problem_core_change::operator=(), pack(), and unpack().

BCP_lp_relax* BCP_problem_core::matrix

A pointer to the constraint matrix corresponding to the core variables and cuts. Definition at line 54 of file BCP_problem_core.hpp. Referenced by BCP_problem_core(), clear(), pack(), and unpack().

BCP_vec<BCP_var_core*> BCP_problem_core::vars

A vector of pointers to the variables in the core of the problem. These are the variables that always stay in the problem formulation. Definition at line 48 of file BCP_problem_core.hpp. Referenced by BCP_problem_core(), clear(), BCP_problem_core_change::operator=(), pack(), unpack(), and varnum().

---

The documentation for this class was generated from the following files:

• BCP_problem_core.hpp
• BCP_problem_core.cpp

---