Originally posted by: SystemAdmin

[ArushGadkar said:]

Hello All,
Could you please have a look into the problem i am having with cplex.
I have nodes = 5; colors = 2;
I have a IloNumVar array W[nodes][colors] declared in cplex.

I want to find all the maximal cliques from the set of nodes assigned the same color (Every node gets assigned to only one color). Then when i have found out those maximal cliques, i want to add the constraints as follows:

say if node 1,3,4,5 are assigned to color 1 : then if maximal cliques are {1,4,5} and {1,3}

U[1] + U[3] < 100; U&#91;1&#93; + U&#91;4&#93; + U&#91;5&#93; <100;<br />
I have implemented a program in C++ to find maximal cliques. The problem i have is as follows:

to pass a variable (columns of W) to the C++ function  which finds maximal cliques. I tried using IloIfThen(W[i][j] == 1, K.push_back(i) ). where K is defined as a regular C++ vector. This gives a compatibility error.

I also tried just executing the clique function on the columns of W. The problem there is .... in the function i need to check if two vertices are adjacent to each other.... for which i need to implement if(A[W[i][j]][W[i'][j]] == 1) this also gives a compatibility error.

The final obective is to max(IloSum(U)).
Could you recommend as to how should i proceed with this problem.

Thanks for your help.
Arush.
#DecisionOptimization
#MathematicalProgramming-General