On 26/01/12 15:09, Bogdan Tanasa wrote: > I have a problem for which the boolean optimization variables are of the > following form (a matrix): > > > > x_11, x_12, .., x_1n > > x_21, x_22, .., x_2n > > . > > x_n1, x_n2, .., x_nn > > > > In my case a solution of the form > > 0 1 0 1 > > 0 0 0 1 > > 0 1 0 1 > > Is identical with > > 1 0 1 0 > > 0 0 1 0 > > 1 0 1 0 > >> From the cost function point of view. > > > > Can you please tell me how to ignore exploring the symmetrical solutions of > this form ? To avoid this symmetry (this very symmetry), you can add the constraint: X_11 #\= 0 or X_12 #\= 1 or X_13 #\= 0 or X_14 #\= 1 or X_21 #\= 0 or X_22 #\= 0 or X_23 #\= 0 or X_24 #\= 1 or X_31 #\= 0 or X_32 #\= 1 or X_33 #\= 0 or X_34 #\= 1 If you want something more general, you might want to explain in more detail why these two solutions are symmetric in your problem. Best, Marco -- Marco Gavanelli, Ph.D. in Computer Science Dept of Engineering University of Ferrara Tel/Fax +39-0532-97-4833 http://www.ing.unife.it/docenti/MarcoGavanelli/Received on Thu Jan 26 2012 - 15:42:47 CET
This archive was generated by hypermail 2.3.0 : Tue Apr 16 2024 - 09:13:20 CEST