nsz Git - libfirm/blob - ir/be/becopyilp2.c

   1 /**
   2  * Author:      Daniel Grund
   3  * Date:                28.02.2006
   4  * Copyright:   (c) Universitaet Karlsruhe
   5  * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
   6  *
   7  * ILP formalization using G=(V, E, Q):
   8  *  - 1 class of variables: equal color vars
   9  *  - Path constraints
  10  *  - Clique path constraints
  11  *
  12  *
  13  *      \min \sum_{ (i,j) \in Q }  w_ij y_ij
  14  *
  15  *              y_ij                            =  1                    (i,j) \in E
  16  *
  17  *              \sum_c y_nc                     =  |C| - 1              n \in N, c \in C
  18  *
  19  *              y_nc                            =  1                    n \in N, c \not\in C(n)
  20  *
  21  *              \sum_{e \in p} y_e      >= 1                    p \in P         path constraints
  22  *
  23  *              \sum_{e \in cp} y_e     >= |cp| - 1             cp \in CP       clique-path constraints
  24  *
  25  *              y_ij \in N,   w_ij \in R^+
  26  */
  27
  28 #include "becopyilp_t.h"
  29
  30 int co_solve_ilp2(copy_opt_t *co, double time_limit) {
  31         int res = 1;
  32
  33         return res;
  34 }