Content deleted Content added
Tyrneaeplith (talk | contribs) →Comparison with the simplex algorithm for linear optimization: Note about the lack of a merit function: this is the counter the fact that the article reads like being a full combinatorial algorithm is a general advantage |
Tyrneaeplith (talk | contribs) →Description: Deleted sentence: It is not meaningful to say in an examples section that "examples have been published", even if true obviously. |
||
Line 23:
{{Expand section|date=April 2011}}
The criss-cross algorithm has been specified in many publications and implemented in many programming languages.
==Computational complexity: Worst and average cases==
| |||