Hello!!
I am solving linear problems with integer and mostly (80%) binary variables,
and I am planning to use the GLPK B&B solver. I know the problem is NP-hard
(unfortunately).
Does anybody have experiences regarding the execution times (on whatever
hardware you have used) when using various matrix sizes? For example, with
1000, 10000, 100000, a million, ten million elements? (Does GLPK contain any
optimization for binary elements?)
Thank you a lot for sharing any experiences.
Best regards
Bjoern
___________________________________________________________
Gesendet von Yahoo! Mail - Jetzt mit 1GB Speicher kostenlos - Hier anmelden: http://mail.yahoo.de
_______________________________________________
Help-glpk mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/help-glpk
