Hello,
I'm trying to solve a binary integer programming problem. I'm using matlab (bintprog function) and the problem is that I get a single optimal solution (with brunch techniques). I know that my problem has more than one solutions (with equal cost). Is there any way to get complete set of solutions with GLPK? Thank you, George Athanasiou cid:[email protected] George Athanasiou Ph.D. Candidate University of Thessaly Department of Computer and Communications Engineering Centre for Research and Technology Hellas Glavani 37 & 28 Oktovriou 38221, Volos, Greece Tel: +30 24210 74553 Fax: +30 24210 74668 e-mail: <mailto:[email protected]> [email protected] web page: <http://www.inf.uth.gr/~gathanas> http://www.inf.uth.gr/~gathanas cid:[email protected]
<<image001.png>>
_______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
