Hello Jordan, > And I want to know if I can generate all the solution of a problem, and > not the most optimized yes by iteratively suppressing previously found solutions via additional constraints and resolving the new problem.
Read this thread: http://lists.gnu.org/archive/html/help-glpk/2011-02/msg00035.html Best regards Xypron -------- Original-Nachricht -------- > Datum: Thu, 07 Apr 2011 16:31:46 +0200 > Betreff: [Help-glpk] Find solutions without objective function > Hello, > I'm using GLPK (with glpsol and the C API). > And I want to know if I can generate all the solution of a problem, and > not the most optimized. Is it possible to have all solutions of a > problem without an objective function ? Just using the constraints. > For example, for a Sudoku, have all the different solutions. > > Thanks. > > Jordan. > > > _______________________________________________ > Help-glpk mailing list > [email protected] > http://lists.gnu.org/mailman/listinfo/help-glpk -- GMX DSL Doppel-Flat ab 19,99 Euro/mtl.! Jetzt mit gratis Handy-Flat! http://portal.gmx.net/de/go/dsl _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
