alpar [Thu, 25 Jan 2007 14:38:55 +0000] rev 2353
A push/relabel type max cardinality matching implementation.
(slightly incompatible with bipartite_matching.h)
alpar [Thu, 25 Jan 2007 14:36:21 +0000] rev 2352
Doc improvements
deba [Tue, 23 Jan 2007 13:13:39 +0000] rev 2351
Correction of the wrong base class
alpar [Tue, 23 Jan 2007 12:51:39 +0000] rev 2350
Several doc improvements.
athos [Mon, 22 Jan 2007 12:13:57 +0000] rev 2349
Small bug corrected.
alpar [Mon, 22 Jan 2007 10:22:14 +0000] rev 2348
- Some bugfixes
- Better doc
- liftToTop(), liftTo() added
alpar [Fri, 19 Jan 2007 17:27:22 +0000] rev 2347
Spellcheck
alpar [Fri, 19 Jan 2007 17:15:15 +0000] rev 2346
elevator.h: A class for handling item labels in push-relabel type algorithms
athos [Fri, 12 Jan 2007 16:29:06 +0000] rev 2345
One important thing only: equality-type constraint can now be added to an lp. The prettyPrint functions are not too pretty yet, I accept.
deba [Thu, 11 Jan 2007 22:08:18 +0000] rev 2344
Bug fix
deba [Thu, 11 Jan 2007 21:58:30 +0000] rev 2343
G++-3.3 conform solution
deba [Thu, 11 Jan 2007 21:35:14 +0000] rev 2342
Bug fix
deba [Thu, 11 Jan 2007 21:27:51 +0000] rev 2341
Undirected minimum cut benchmarking
deba [Thu, 11 Jan 2007 21:22:39 +0000] rev 2340
Make Hao-Orlin epsilon-safe
deba [Thu, 11 Jan 2007 21:20:57 +0000] rev 2339
Bug fix
deba [Thu, 11 Jan 2007 21:06:47 +0000] rev 2338
Changing implementation of undirected graphs
slightly faster, 10% speed-up
deba [Thu, 11 Jan 2007 21:05:00 +0000] rev 2337
Adding two heuristics
Based on:
http://www.avglab.com/andrew/pub/neci-tr-96-132.ps
athos [Tue, 09 Jan 2007 11:42:43 +0000] rev 2336
Nothing serious.
deba [Mon, 08 Jan 2007 10:39:59 +0000] rev 2335
New path concept and path structures
TODO: BellmanFord::negativeCycle()
athos [Fri, 05 Jan 2007 10:59:18 +0000] rev 2334
I only corrected some errors in the documentation.
deba [Tue, 19 Dec 2006 15:53:42 +0000] rev 2333
MACROS for debug map usage
deba [Tue, 19 Dec 2006 14:00:43 +0000] rev 2332
Bug fix
deba [Mon, 18 Dec 2006 14:35:33 +0000] rev 2331
Easier inverse than m.inverse()[a] => m(a)
deba [Mon, 18 Dec 2006 10:12:07 +0000] rev 2330
Better handling of inexact computation.
We do not use tolerance for excess, just for edges
deba [Tue, 12 Dec 2006 13:35:52 +0000] rev 2329
clone => build renaming
athos [Thu, 07 Dec 2006 16:10:54 +0000] rev 2328
Query functions have been implemented for GLPK (CPLEX breaks at the moment, I guess): These functions include:
retrieving one element of the coeff. matrix
retrieving one element of the obj function
lower bd for a variable
upper bound for a variable
lower and upper bounds for a row (these can not be handled separately at the moment)
direction of the optimization (is_max() function)
alpar [Mon, 04 Dec 2006 18:09:09 +0000] rev 2327
More sophisticated warning messages.
alpar [Mon, 04 Dec 2006 18:08:30 +0000] rev 2326
Fix 'unused variable' warnings