id	summary	reporter	owner	description	type	status	priority	milestone	component	version	resolution	keywords	cc	revision
438	Optional iteration limit in HowardMmc	Peter Kovacs	Peter Kovacs	"Howard's algorithm performs several iterations that successively approximates the minimum cycle mean. After a finite number of iterations, the algorithm finds the optimal solution. It is quite efficient in practice, but no polynomial bound is known for the number of iterations.

Therefore, it seems to be practical if an optional limit for the number of iterations could be passed to the algorithm."	enhancement	closed	major	LEMON 1.3 release	core	hg main	fixed