BCP_vg.hpp

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

// This file is fully docified.

#include <cfloat>

#include "BCP_message_tag.hpp"
#include "BCP_vector.hpp"
#include "BCP_buffer.hpp"
#include "BCP_vg_param.hpp"
#include "BCP_parameters.hpp"
#include "BCP_process.hpp"

class BCP_vg_user;
class BCP_message_environment;
class BCP_proc_id;
class BCP_problem_core;
class BCP_var;
class BCP_cut;

class BCP_vg_prob : public BCP_process {
private:
   BCP_vg_prob(const BCP_vg_prob&);
   BCP_vg_prob& operator=(const BCP_vg_prob&);
public:
   // User provided members--------------------------------------------------
   BCP_vg_user* user;
   BCP_message_environment* msg_env;

   BCP_buffer  msg_buf;

   BCP_parameter_set<BCP_vg_par> par;

   BCP_problem_core* core;
   
   BCP_proc_id* tree_manager;

   double upper_bound;

   // the cuts and corresponding dual values in the LP formulation that were
   // sent over to generate variables from. Also, the sender and which node
   // in which iteration do these cuts/duals belong to.
   BCP_vec<BCP_cut*> cuts;
   BCP_vec<double>   pi;
   BCP_proc_id*      sender;

   int phase;
   int node_level;
   int node_index;
   int node_iteration;

public:
   BCP_vg_prob();
   virtual ~BCP_vg_prob();
   inline bool has_ub() const { return upper_bound < DBL_MAX; }
   inline double ub() const   { return upper_bound; }
   inline void ub(const double bd) { upper_bound = bd; }

   bool probe_messages();
   BCP_cut* unpack_cut();
   //--------------------------------------------------------------------------
   virtual BCP_buffer& get_message_buffer() { return msg_buf; }
   virtual BCP_proc_id* get_parent() { return tree_manager; }
   virtual void process_message();
};

// This function is used only internally.
bool
BCP_vg_process_message(BCP_vg_prob& p, BCP_buffer& buf);

#endif

---