Hello, I have a problem of 1-to-1 match between elements of a first set with those of a second set according with the minimisation of a "distance" between the various elements..
I have try a simple trial matrix in Excel and it works (attached image), but
the real problem has 375 elements in each set resulting in a matrix with
375*375 decision variables and 375*2 bounds (all continuous).
Can glpk handle such problem on a good pc??
Cheers,
Antonello Lobianco
--
Antonello Lobianco
Università Politecnica delle Marche
Dipartimento di Economia
P.le Martelli, 8 - 60121 Ancona Italy
TEl: +39.071.2207106
FAX: +39.071.2207102
OpenDocument welcome
<<attachment: testMatrix.png>>
_______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
