Hi everybody, Does anybody have tried to solve a Sudoko instance with a BigM method (to say "all of the digits of a line must be different"). There is solution without this method. How can someone know where and when GLPK is "able" or not (actually the Simplex method used) to solve such problems. Any help on this would be appreciable.
Regards Alex ------------------------------- Alexandre Saidi Maitre de Conférences Ecole Centrale de Lyon-Dép. MI LIRIS-CNRS UMR 5205 Tél : 0472186530, Fax : 0472186443 _______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
