ali atik

Hi, Thomas Following your previous advice( before the latest one) , and by decomposing the" AllDifferent" constraint, into a clique of neq constraints, and using the , DSAagentJaCoP , i noticed a slight improvement, i'll try this one too , and compare the difference. --

Hi , Thomas unfortunately the spinning problem, is always here with more than 5 users (6!) , and no more than 5 utilities per source , the resolver stumbles , i think its about the last contraint "AllDifferent constraint", here i have concatenated the domains of all the sources. --

Hi, Thomas Thank you very much indeed , -- ali

Hi, Thomas i have little question here , in your last formulation , and exactly in the first point , "Each user gets exactly 1 resource" , do you mean that in your mind , there is only one domain for all users ? so , for me the the index j = 1 , of the domain A = { 20 30 17} corresponds to the utility 20 so this means for the user(0) =j =1 the resource of utility 20 is assigned to the user(0), sorry i am a little lost here, can you be less cryptic ?

Hi , in the second point, regarding the redundancy of the (nij and uij), for me the -- n(ij) is an auxiliary variable for the u(ij) variable, and i have to make constraints on u(ij) in addition to constraints on n(ij) , to make things work, and i didn't understand your first suggestion, if you mean the n(ij) will match the domain (i) and the j-th element in this domain how to enforce the 7 places constraint without an auxiliary variable since the n(ij) values will be diffrent of( 0,1) values, the...

Sorry i have hited the wrong button (and i have more things to say)

Hi, Mr Thomas first i would like to thank you for your valuatble time, and for you acadimic answers. i have created xml generator (to generate the problems for the need of any moment in my sytem), and the problem is that beyond a cetain( threshold the number of zones of allocation,and some number of palaces) the resolver (keep running without answer). that means that my constraints formulation, finds solutions that are valid - i have joind as an attachement a problem randomly generated , to support...

Hi, It is a problem of allocation of places, the domains dup (i) is for a corresponding areas (i), the n(ij) corespond to the allocation of the place number (j) of the area (i) nij = 1 correpond to an allocation of this place and nij = 0 (no allocation of this place), in this problem there is for each allocation n (ij) possible a utility u (ij) corresponding to it in the corresponding domain dup(i) in this problem the global constraint: weightedSum to ensure an allocation for 6 places (as it was...