Balazs Dezso <deba@inf.elte.hu> [Tue, 16 Nov 2010 08:19:11 +0100] rev 1023
Use member variables to store the highest IDs in bipartite partitions (#69)
Balazs Dezso <deba@inf.elte.hu> [Tue, 16 Nov 2010 00:59:36 +0100] rev 1022
Implementation of BpGraphCopy (#69)
Balazs Dezso <deba@inf.elte.hu> [Mon, 15 Nov 2010 09:46:08 +0100] rev 1021
ListBpGraph implementation (#69)
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Nov 2010 22:48:32 +0100] rev 1020
FullBpGraph implementation (#69)
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Nov 2010 20:06:23 +0100] rev 1019
SmartBpGraph implementation (#69)
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Nov 2010 16:35:31 +0100] rev 1018
Add bipartite graph concepts (#69)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 24 Feb 2013 19:44:14 +0100] rev 1017
Better Maintainer build type settings (for MSVC)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 22 Feb 2013 16:49:41 +0100] rev 1016
Merge bugfix #445
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Jul 2012 21:23:17 +0200] rev 1015
Fix missing initialization in CplexEnv::CplexEnv() (#445)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 22 Feb 2013 14:12:48 +0100] rev 1014
Merge #438 and #436
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 15 Nov 2012 07:17:48 +0100] rev 1013
Ensure strongly polynomial running time for CycleCanceling (#436)
The number of iterations performed by Howard's algorithm is limited.
If the limit is reached, a strongly polynomial implementation,
HartmannOrlinMmc is executed to find a minimum mean cycle.
This iteration limit is typically not reached, thus the combined
method is practically equivalent to Howard's algorithm, while it
also ensures the strongly polynomial time bound.
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 15 Nov 2012 07:05:29 +0100] rev 1012
Optional iteration limit in HowardMmc (#438)