cp_knapsack.h

#ifndef KNAPSACK_H
#define KNAPSACK_H

#include <scil/scil.h>
#include <set>
#include <vector>

namespace SCIL {

class LCI : public cons_obj {

   public:

      std::vector<int> coeff_array ;
      int  rhs ;
      std::map<int,var>&  item_index_map ;
  
      LCI(std::vector<int> coeff,int r, std::map<int,var>&  map);
      ~LCI();

      /*  
         virtual  double coeff(var_obj* v);
       */
  
      virtual void non_zero_entries(row& r);

};

class CP_KNAPSACK : public sym_constraint {

   private:

      cons_obj* KC ;
      std::map<int,var> item_index_map; 
      double violation_tolerance ;
      bool lifted_in_C2 ;
      bool lifted_in_F ;
      int index ; 
      int rightsum ;
      int gammasum ;
      int Ti ;
      int number_variables ;                    
      int r ;
      int previous_lift_index ; 
      int righthandside ;
      bool no_sep ;
      std::list<int> negative_coeff_indices ;  
      std::vector<int>  liftcoeffs ;
      std::vector<int>  coeffs ;                

      std::map<int,double>  fractional_point ; 
      std::vector<int> sort_array ;             
      std::vector<int> liftsequence_on_R ;      
      std::vector<int> liftsequence_on_C2 ;     
      std::vector<int>* W1 ;
      std::vector<int>* W2 ;
      std::set<int> F ;
      std::set<int> R ;
      std::set<int> C1 ;
      std::set<int> C2 ;
      std::set<int> to_lift_in_F ;
      std::set<int> to_lift_in_C2 ;
      std::set<int> to_lift_in_R ;
      std::set<int> N ;

      int find_largest_index(std::vector<int> vec, int val);

   public:
 
      CP_KNAPSACK(cons_obj* KCt, double tolerance=0.001);
 
      void init(subproblem& S);  
 

      void update_Ti(int x);

      void update_gammasum(int x);

      int init_righthandsum();

      int update_righthandsum(int x);


      bool compute_cover();

      void lift_on_F( std::vector<int>* W );
  
      void lift_on_C2 ( std::vector<int>* W );
  
      void lift_on_R ( std::vector<int>* W );
  
      void compute_first_row();
  
      void compute_next_row();
  
      void setup_values(subproblem& S);

      status standard_separation(subproblem& S);

      void info();
};

}

#endif

---