Hi, I know that the "lpx_integer" and the "lpx_intopt" routines are using the branch-and-bound method. Does anyone knows the computation complexity of both of the routines? Are they exponential? Thank you. Rdgs, Paul
Get your preferred Email name!
Now you can @ymail.com and @rocketmail.com
http://mail.promotions.yahoo.com/newdomains/sg/_______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
