Peter Kovacs <kpeter@inf.elte.hu> [Sun, 09 Jan 2011 15:06:55 +0100] rev 1036
Make InsertionTsp much faster and improve docs (#386)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 09 Jan 2011 00:57:12 +0100] rev 1035
A detailed test file for TSP algorithms (#386)
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 09 Jan 2011 00:56:52 +0100] rev 1034
Unifications and improvements in TSP algorithms (#386)
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 08 Jan 2011 22:51:16 +0100] rev 1033
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.
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 08 Jan 2011 22:49:09 +0100] rev 1032
Doc group for TSP algorithms (#386)
Gabor Varga <f4c3@inf.elte.hu> [Sat, 08 Jan 2011 21:59:56 +0100] rev 1031
Heuristic algorithms for symmetric TSP (#386)
Balazs Dezso <deba@google.com> [Tue, 12 Feb 2013 07:15:52 +0100] rev 1030
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
Daniel Poroszkai <poroszd@inf.elte.hu> [Sun, 05 Feb 2012 00:04:44 +0100] rev 1029
Update LGF reader to work with typesafe bipartite node sets (#69)
Balazs Dezso <deba@inf.elte.hu> [Wed, 11 Jan 2012 22:58:05 +0100] rev 1028
Doc fix in BpGraphs (#69)
Balazs Dezso <deba@inf.elte.hu> [Wed, 11 Jan 2012 22:43:50 +0100] rev 1027
Remove asRedBludeNode() function (#69)
Balazs Dezso <deba@inf.elte.hu> [Wed, 11 Jan 2012 22:21:07 +0100] rev 1026
Renamings in BpGraphs (#69)
- RedIt->RedNodeIt
- BlueIt->BlueNodeIt
- RedMap->RedNodeMap
- BlueMap->BlueNodeMap
Balazs Dezso <deba@inf.elte.hu> [Thu, 01 Dec 2011 09:05:47 +0100] rev 1025
Type safe red and blue node set (#69)
Balazs Dezso <deba@inf.elte.hu> [Thu, 25 Nov 2010 22:45:29 +0100] rev 1024
LGF reader and writer for bipartite graphs (#69)
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.