id	summary	reporter	owner	description	type	status	priority	milestone	component	version	resolution	keywords	cc	revision
328	Heuristic MinCostFlow and MinCostMaxFlow	Peter Kovacs	Peter Kovacs	"It could be worthwhile to create a heuristic min cost flow solver class named `MinCostFlow`. It would have the same interface as the single algorithms, but it could try to select the best algorithm to run according to the parameters of the problem (size of the graph, density, max. capacity etc.). This class could be used in e.g. thew dimacs solver.

Similarly, we could have a heuristic `MinCostMaxFlow` using `Preflow` and `MinCostFlow`. Or the interface of `MinCostFlow` could be extended to support min cost max flow. See also #244.

This ticket is a follow-up of #180.

"	enhancement	assigned	major	LEMON 1.5 release	core	hg main