Mercuriallemon / changelog
summary | shortlog | changelog | graph | tags | bookmarks | branches | files | bz2 | zip | gz | help
(0) -1000 -300 -100 -30 -15 +15 +30 +100 tip
Thu, 15 Nov 2012 07:17:48 +0100Ensure strongly polynomial running time for CycleCanceling (#436)
changeset
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 15 Nov 2012 07:17:48 +0100] rev 1179
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.

Thu, 15 Nov 2012 07:05:29 +0100Optional iteration limit in HowardMmc (#438)
changeset
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 15 Nov 2012 07:05:29 +0100] rev 1178
Optional iteration limit in HowardMmc (#438)

Wed, 28 Nov 2012 12:08:47 +0100Further GCC 4.7 compiler warning fix (#453)
changeset
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 12:08:47 +0100] rev 1177
Further GCC 4.7 compiler warning fix (#453)

Wed, 28 Nov 2012 12:05:27 +0100Merge bugfix #453
changeset
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 12:05:27 +0100] rev 1176
Merge bugfix #453

Wed, 28 Nov 2012 12:02:36 +0100Merge bugfix #453 to branch 1.2 1.2
changeset
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 12:02:36 +0100] rev 1175
Merge bugfix #453 to branch 1.2

Wed, 28 Nov 2012 11:58:00 +0100Further GCC 4.7 compiler warning fixes (#453)
changeset
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 11:58:00 +0100] rev 1174
Further GCC 4.7 compiler warning fixes (#453)

Wed, 28 Nov 2012 11:54:43 +0100Merge #453 to branches >=1.2
changeset
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 11:54:43 +0100] rev 1173
Merge #453 to branches >=1.2

Wed, 28 Nov 2012 11:42:38 +0100Merge bugfix #453 to branch 1.1 1.1
changeset
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 11:42:38 +0100] rev 1172
Merge bugfix #453 to branch 1.1

Wed, 28 Nov 2012 11:41:40 +0100Avoid GCC 4.7 compiler warnings (#453)
changeset
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 11:41:40 +0100] rev 1171
Avoid GCC 4.7 compiler warnings (#453)

Thu, 08 Nov 2012 09:07:41 +0100Merge bugfix #440
changeset
Alpar Juttner <alpar@cs.elte.hu> [Thu, 08 Nov 2012 09:07:41 +0100] rev 1170
Merge bugfix #440

Wed, 07 Nov 2012 18:13:26 +0100Merge bugfix #440 to branch 1.2 1.2
changeset
Alpar Juttner <alpar@cs.elte.hu> [Wed, 07 Nov 2012 18:13:26 +0100] rev 1169
Merge bugfix #440 to branch 1.2

Wed, 07 Nov 2012 18:10:07 +0100Merge bugfix #440 to branch 1.1 1.1
changeset
Alpar Juttner <alpar@cs.elte.hu> [Wed, 07 Nov 2012 18:10:07 +0100] rev 1168
Merge bugfix #440 to branch 1.1

Wed, 28 Mar 2012 19:39:56 +0200Fix a bug + remove redundant typedefs in dimacs-solver (#440)
changeset
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 28 Mar 2012 19:39:56 +0200] rev 1167
Fix a bug + remove redundant typedefs in dimacs-solver (#440)

Wed, 07 Nov 2012 17:39:39 +0100Merge docfix #437
changeset
Alpar Juttner <alpar@cs.elte.hu> [Wed, 07 Nov 2012 17:39:39 +0100] rev 1166
Merge docfix #437

Mon, 30 Jan 2012 23:24:40 +0100Doc improvements for min cost flow algorithms (#437)
changeset
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 30 Jan 2012 23:24:40 +0100] rev 1165
Doc improvements for min cost flow algorithms (#437)

(0) -1000 -300 -100 -30 -15 +15 +30 +100 tip
lemon