monomial_inst.h

#ifndef MONOMIAL_INST_H
#define MONOMIAL_INST_H

#include<scil/core/monomial.h>
#include<scil/core/nonlinear_inst.h>
#include<scil/core/qmonomial.h>


namespace SCIL{
  class mon_split_strategy {
      protected:
         std::list<monomial*> toDelete;
      public:
         mon_split_strategy(){}
         mon_split_strategy(std::list<monomial>& mons){} 
         virtual ~mon_split_strategy() {
            for(std::list<monomial*>::iterator it=toDelete.begin(); it != toDelete.end(); it++)
               delete *it;
            }
         virtual bool split(monomial& mToSplit, monomial*& m1, monomial*& m2){}
   };


   class mon_simple_split : public mon_split_strategy {
      public:
         mon_simple_split() {}
         bool split(monomial& mToSplit, monomial*& m1, monomial*& m2);
   };

   class mon_score_split : public mon_split_strategy {
      private:
         std::map<var,int> varIndex;
         std::vector<std::vector<int> > scoreMatrix;
         

      public:
         mon_score_split(std::list<monomial>& mons); 
         bool split(monomial& mToSplit, monomial*& m1, monomial*& m2);
   };


 
  class monomial_inst : public nonlinear_inst {
     private:
        mon_split_strategy* splitStrategy;
        void decompose(std::list<monomial>& mons, ILP_Problem& IP);
     public:
        monomial_inst(std::list<monomial>& m, ILP_Problem& IP, mon_split_strategy* spst);
        ~monomial_inst();
        virtual status feasible(solution& S);



  };
}
#endif

---