The time complexity of the Hungarian method is O(n^3). I was unable to determine how this relates to the complexity of the network simplex method.
Ali _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
