Tue, 28 Aug 2007 14:00:42 +0000 deba PathNodeIt
Tue, 28 Aug 2007 13:58:54 +0000 deba Redesign of augmenting path based matching
Sat, 25 Aug 2007 10:12:03 +0000 ladanyi Consider the CPXMIP_OPTIMAL_TOL status as OPTIMAL too.
Fri, 24 Aug 2007 14:32:55 +0000 deba uedgeset is an alias for edgeset
Tue, 21 Aug 2007 13:22:21 +0000 deba Query functions: aMatching and bMatching
Sat, 11 Aug 2007 16:34:41 +0000 deba Common interface for bipartite matchings
Thu, 26 Jul 2007 13:59:12 +0000 deba Reporting invalid ID
Thu, 26 Jul 2007 12:18:02 +0000 deba Correction in the line numbering method
Thu, 05 Jul 2007 16:39:42 +0000 deba Sample input for sat-2 and sat demos
Tue, 26 Jun 2007 14:02:08 +0000 deba The mip column addition hack is necessary only for 4.16
Fri, 15 Jun 2007 14:36:24 +0000 deba Improvments in min cost flow algorithms
Fri, 15 Jun 2007 14:32:48 +0000 deba Space reservation for SmartGraph
Fri, 15 Jun 2007 14:31:14 +0000 deba Using set() instead of assignment
Tue, 12 Jun 2007 14:34:28 +0000 alpar Spellcheck
Thu, 07 Jun 2007 20:07:29 +0000 deba Correction for multiple point on starting sweep line
Tue, 05 Jun 2007 17:30:52 +0000 alpar Update the demo file of Circulation
Tue, 05 Jun 2007 17:29:46 +0000 alpar Two new constructors added to dim2::BoundingBox
Tue, 05 Jun 2007 17:27:54 +0000 alpar Negate the meaning of the delta parameter
Tue, 05 Jun 2007 17:24:35 +0000 alpar Minor improvement in Tutorial
Tue, 05 Jun 2007 14:48:20 +0000 alpar Bugfix and improvement in -tsp2 algorithm
Tue, 05 Jun 2007 11:49:19 +0000 deba Delaunay triangulation
Tue, 05 Jun 2007 10:59:16 +0000 alpar A minimum spanning tree based TSP algorithm is added (-tsp2)
Tue, 05 Jun 2007 10:57:26 +0000 alpar - Fix a serious bug in UEulerIt
Fri, 11 May 2007 16:03:20 +0000 deba Patch in network simplex
Fri, 11 May 2007 16:02:53 +0000 deba Patch for retrieving reached/processed node in dijkstra, bfs and dfs
Thu, 10 May 2007 14:56:05 +0000 deba Bug fix
Mon, 07 May 2007 18:19:55 +0000 deba Conformity to new GLPK interface
Mon, 07 May 2007 11:42:18 +0000 deba Various min cost flow solvers