Sun, 09 Jan 2011 15:06:55 +0100Make InsertionTsp much faster and improve docs (#386)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 09 Jan 2011 15:06:55 +0100] rev 1204
Make InsertionTsp much faster and improve docs (#386)

Sun, 09 Jan 2011 00:57:12 +0100A detailed test file for TSP algorithms (#386)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 09 Jan 2011 00:57:12 +0100] rev 1203
A detailed test file for TSP algorithms (#386)

Sun, 09 Jan 2011 00:56:52 +0100Unifications and improvements in TSP algorithms (#386)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 09 Jan 2011 00:56:52 +0100] rev 1202
Unifications and improvements in TSP algorithms (#386)

Sat, 08 Jan 2011 22:51:16 +0100Document and greatly improve TSP algorithms (#386)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 08 Jan 2011 22:51:16 +0100] rev 1201
Document and greatly improve TSP algorithms (#386)

- Add LEMON headers.
- Add Doxygen doc for all classes and their members.
- Clarify and unify the public API of the algorithms.
- Various small improvements in the implementations to make
them clearer and faster.
- Avoid using adaptors in ChristofidesTsp.

Sat, 08 Jan 2011 22:49:09 +0100Doc group for TSP algorithms (#386)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 08 Jan 2011 22:49:09 +0100] rev 1200
Doc group for TSP algorithms (#386)

Sat, 08 Jan 2011 21:59:56 +0100Heuristic algorithms for symmetric TSP (#386)
Gabor Varga <f4c3@inf.elte.hu> [Sat, 08 Jan 2011 21:59:56 +0100] rev 1199
Heuristic algorithms for symmetric TSP (#386)

Tue, 12 Feb 2013 07:15:52 +0100Changes in BpGraph lgf reader and writer (#69)
Balazs Dezso <deba@google.com> [Tue, 12 Feb 2013 07:15:52 +0100] rev 1198
Changes in BpGraph lgf reader and writer (#69)
- Add typesade RedNode and BlueNode reading and writing
- RedNodes and BlueNodes don't need to have distinct label set
- Add tests

Sun, 05 Feb 2012 00:04:44 +0100Update LGF reader to work with typesafe bipartite node sets (#69)
Daniel Poroszkai <poroszd@inf.elte.hu> [Sun, 05 Feb 2012 00:04:44 +0100] rev 1197
Update LGF reader to work with typesafe bipartite node sets (#69)

Wed, 11 Jan 2012 22:58:05 +0100Doc fix in BpGraphs (#69)
Balazs Dezso <deba@inf.elte.hu> [Wed, 11 Jan 2012 22:58:05 +0100] rev 1196
Doc fix in BpGraphs (#69)

Wed, 11 Jan 2012 22:43:50 +0100Remove asRedBludeNode() function (#69)
Balazs Dezso <deba@inf.elte.hu> [Wed, 11 Jan 2012 22:43:50 +0100] rev 1195
Remove asRedBludeNode() function (#69)

Wed, 11 Jan 2012 22:21:07 +0100Renamings in BpGraphs (#69)
Balazs Dezso <deba@inf.elte.hu> [Wed, 11 Jan 2012 22:21:07 +0100] rev 1194
Renamings in BpGraphs (#69)
- RedIt->RedNodeIt
- BlueIt->BlueNodeIt
- RedMap->RedNodeMap
- BlueMap->BlueNodeMap

Thu, 01 Dec 2011 09:05:47 +0100Type safe red and blue node set (#69)
Balazs Dezso <deba@inf.elte.hu> [Thu, 01 Dec 2011 09:05:47 +0100] rev 1193
Type safe red and blue node set (#69)

Thu, 25 Nov 2010 22:45:29 +0100LGF reader and writer for bipartite graphs (#69)
Balazs Dezso <deba@inf.elte.hu> [Thu, 25 Nov 2010 22:45:29 +0100] rev 1192
LGF reader and writer for bipartite graphs (#69)

Tue, 16 Nov 2010 08:19:11 +0100Use member variables to store the highest IDs in bipartite partitions (#69)
Balazs Dezso <deba@inf.elte.hu> [Tue, 16 Nov 2010 08:19:11 +0100] rev 1191
Use member variables to store the highest IDs in bipartite partitions (#69)

Tue, 16 Nov 2010 00:59:36 +0100Implementation of BpGraphCopy (#69)
Balazs Dezso <deba@inf.elte.hu> [Tue, 16 Nov 2010 00:59:36 +0100] rev 1190
Implementation of BpGraphCopy (#69)

Mon, 15 Nov 2010 09:46:08 +0100ListBpGraph implementation (#69)
Balazs Dezso <deba@inf.elte.hu> [Mon, 15 Nov 2010 09:46:08 +0100] rev 1189
ListBpGraph implementation (#69)

Sun, 14 Nov 2010 22:48:32 +0100FullBpGraph implementation (#69)
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Nov 2010 22:48:32 +0100] rev 1188
FullBpGraph implementation (#69)

Sun, 14 Nov 2010 20:06:23 +0100SmartBpGraph implementation (#69)
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Nov 2010 20:06:23 +0100] rev 1187
SmartBpGraph implementation (#69)

Sun, 14 Nov 2010 16:35:31 +0100Add bipartite graph concepts (#69)
Balazs Dezso <deba@inf.elte.hu> [Sun, 14 Nov 2010 16:35:31 +0100] rev 1186
Add bipartite graph concepts (#69)

Sun, 24 Feb 2013 19:44:14 +0100Better Maintainer build type settings (for MSVC)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 24 Feb 2013 19:44:14 +0100] rev 1185
Better Maintainer build type settings (for MSVC)

Fri, 22 Feb 2013 16:49:41 +0100Merge bugfix #445
Alpar Juttner <alpar@cs.elte.hu> [Fri, 22 Feb 2013 16:49:41 +0100] rev 1184
Merge bugfix #445

Fri, 22 Feb 2013 16:44:26 +0100Merge bugfix #445 to branch 1.2 1.2
Alpar Juttner <alpar@cs.elte.hu> [Fri, 22 Feb 2013 16:44:26 +0100] rev 1183
Merge bugfix #445 to branch 1.2

Fri, 22 Feb 2013 16:42:56 +0100Merge bugfix #445 to branch 1.1 1.1
Alpar Juttner <alpar@cs.elte.hu> [Fri, 22 Feb 2013 16:42:56 +0100] rev 1182
Merge bugfix #445 to branch 1.1

Fri, 20 Jul 2012 21:23:17 +0200Fix missing initialization in CplexEnv::CplexEnv() (#445)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Jul 2012 21:23:17 +0200] rev 1181
Fix missing initialization in CplexEnv::CplexEnv() (#445)

Fri, 22 Feb 2013 14:12:48 +0100Merge #438 and #436
Alpar Juttner <alpar@cs.elte.hu> [Fri, 22 Feb 2013 14:12:48 +0100] rev 1180
Merge #438 and #436

Thu, 15 Nov 2012 07:17:48 +0100Ensure strongly polynomial running time for CycleCanceling (#436)
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)
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)
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
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
Alpar Juttner <alpar@cs.elte.hu> [Wed, 28 Nov 2012 12:02:36 +0100] rev 1175
Merge bugfix #453 to branch 1.2