|
| From: | Ali Baharev |
| Subject: | Re: [Help-glpk] time complexity in glpk |
| Date: | Wed, 19 Aug 2009 15:55:48 +0200 |
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
| [Prev in Thread] | Current Thread | [Next in Thread] |