BCP_branch.hpp

Go to the documentation of this file.

// Copyright (C) 2000, International Business Machines
// Corporation and others.  All Rights Reserved.
#ifndef _BCP_BRANCH_H
#define _BCP_BRANCH_H

// This file is fully docified.

#include "BCP_vector.hpp"

class OsiSolverInterface;
class BCP_buffer;
class BCP_lp_branching_object;

//#############################################################################

class BCP_internal_brobj {
private:
   BCP_internal_brobj(const BCP_internal_brobj&);
   BCP_internal_brobj& operator=(const BCP_internal_brobj&);
private:
   int _child_num;
   BCP_vec<int> _var_positions;
   BCP_vec<int> _cut_positions;
   BCP_vec<double> _var_bounds; // 2*_child_num*_var_positions.size()
   BCP_vec<double> _cut_bounds;
public:
   BCP_internal_brobj() : _child_num(0),
      _var_positions(), _cut_positions(), _var_bounds(), _cut_bounds() {}
   BCP_internal_brobj(BCP_lp_branching_object& candidate);
   ~BCP_internal_brobj() {}
   inline int child_num() const { return _child_num; }
   inline int affected_varnum() const { return _var_positions.size(); }
   inline int affected_cutnum() const { return _cut_positions.size(); }

   inline const BCP_vec<int>& var_positions() const { return _var_positions; }
   inline const BCP_vec<int>& cut_positions() const { return _cut_positions; }

   inline
   BCP_vec<double>::const_iterator var_bounds_child(const int index) const {
      return _var_bounds.entry(2 * _var_positions.size() * index);
   }
   inline
   BCP_vec<double>::const_iterator cut_bounds_child(const int index) const {
      return _cut_bounds.entry(2 * _cut_positions.size() * index);
   }
   void apply_child_bounds(OsiSolverInterface* lp, int child_ind) const;
   void pack(BCP_buffer& buf) const;
   void unpack(BCP_buffer& buf);
};

#endif