poltest.cc

//TODO unite korrekt?
/* Tue Nov  4 11:55:20 CET 2008
 * baumann
 */

#include<fstream>
#include<scil/scil.h>
#include<scil/constraints/cut.h>
#include<scil/core/polynomial.h>
#include<vector>
#include<boost/unordered_map.hpp>

#define LEPS 1e-4
using namespace SCIL;

bool read_instance(char* file_name, unordered_map<int, var>& vm, polynomial& pol, ILP_Problem& IP) {

   ifstream file;
   file.open(file_name);

   int n;
   file >> n; //read the number of variables (and discard)
   file >> n; //read the number of monomials in the obj. function

   int nv;
   int ind;
   double c;
   int ns = 0;
   for( int i = 0; i < n; i++ ) {
      file >> nv; //read the number of variables in the monomial
      file >> c; //read the coefficient of the monomial

      std::vector<var> a(nv);
      for( int j = 0; j < nv; j++ ) {
         file >> ind; //read the index of the variable
         if( vm.find(ind) == vm.end() ) {       // if vm[ind] not yet defined
            ns++;
            vm[ind] = IP.add_binary_variable(0.);
         }
         a[j] = vm[ind];
      }
      pol += monomial(c, a);
   }

   cout << "singletons:" << ns << endl;

   return true;
}

int main(int argc, char** argv) {
   //initialize the ILP
   ILP_Problem IP(Optsense_Max);

   //read the polynomial from file
   unordered_map<int,var> vm;
   polynomial p;
   read_instance(argv[1], vm, p, IP);

   std::cerr << IP.number_of_variables() << endl;
   std::cerr << IP.number_of_constraints() << endl;

   //add the polynomial to the objective function
   IP.add_polynomial(p);

   //solve the problem
   IP.optimize();

   //output the solution
   solution sol = IP.get_solution();
   var v;
   int i;
   unordered_map<int, var>::const_iterator iv;
   foreach(iv, vm) 
      if( sol.value(iv->second) > .9 )
         std::cout << iv->first << " ";
   std::cout << endl;

   return 0;
}

---