alpar [Wed, 28 Jun 2006 06:48:35 +0000] rev 2646
Minor updates
alpar [Tue, 27 Jun 2006 11:33:05 +0000] rev 2645
Some updates based on the last meeting
alpar [Tue, 27 Jun 2006 11:31:07 +0000] rev 2644
Ah, I see...
deba [Mon, 19 Jun 2006 13:49:17 +0000] rev 2643
without log
alpar [Tue, 13 Jun 2006 18:10:15 +0000] rev 2642
Some updates on the todo list.
alpar [Tue, 13 Jun 2006 16:28:49 +0000] rev 2641
An uncomplete todo list for releasing a stable version of lemon.
It is in emacs Org mode.
alpar [Fri, 09 Jun 2006 09:07:54 +0000] rev 2640
Renamed the branch to lemon-1.0 in order to avoid ambiguity.
alpar [Tue, 06 Jun 2006 17:04:15 +0000] rev 2639
Brach for the stable release 1.0
kpeter [Thu, 04 Jun 2009 01:19:06 +0000] rev 2638
Various improvements for NS pivot rules
kpeter [Mon, 01 Jun 2009 16:53:59 +0000] rev 2637
Remove a faulty check from lp_test.cc
kpeter [Mon, 01 Jun 2009 15:37:51 +0000] rev 2636
Add the Cancel and Tighten min cost flow algorithm
kpeter [Mon, 01 Jun 2009 15:35:27 +0000] rev 2635
XTI data structure for NS - backport hg commit [8c3112a66878]
kpeter [Fri, 06 Feb 2009 21:52:34 +0000] rev 2634
Rework Network Simplex
Use simpler and faster graph implementation instead of SmartGraph
alpar [Wed, 04 Feb 2009 14:42:31 +0000] rev 2633
Remove a faulty include from elevator.h
deba [Sun, 21 Dec 2008 20:13:28 +0000] rev 2632
Backport hg commit [81d40f1c850c] (ticket #197)
deba [Sat, 20 Dec 2008 22:45:48 +0000] rev 2631
Backport hg commit [52c04a2a652c] (ticket #197)
kpeter [Thu, 13 Nov 2008 16:17:50 +0000] rev 2630
Various improvements in NetworkSimplex.
- Faster variant of "Altering Candidate List" pivot rule using make_heap
instead of partial_sort.
- Doc improvements.
- Removing unecessary inline keywords.
kpeter [Thu, 13 Nov 2008 15:29:04 +0000] rev 2629
Improved constructors for min cost flow classes
Removing the non-zero lower bounds is faster
kpeter [Thu, 13 Nov 2008 10:54:42 +0000] rev 2628
Improve tree update procedure in NetworkSimplex
The new method updates a smaller subtree (fixing a bug) and shifting the
potentials with a costant value.
kpeter [Fri, 07 Nov 2008 20:15:10 +0000] rev 2627
Backport doxygen options for version 1.5.7 from [9194a12c52e6]
alpar [Thu, 23 Oct 2008 16:49:06 +0000] rev 2626
Adapt the doc generation to the hg repo
kpeter [Wed, 15 Oct 2008 12:04:11 +0000] rev 2625
Major improvement in the cost scaling algorithm
- Add a new variant that use the partial augment-relabel method.
- Use this method instead of push-relabel by default.
- Use the "Early Termination" heuristic instead of "Price Refinement".
Using the new method and heuristic the algorithm proved to be
2-2.5 times faster on all input files.
deba [Wed, 08 Oct 2008 09:17:01 +0000] rev 2624
Bug fixes is HaoOrlin and MinCostArborescence
MinCostArborescence
- proper deallocation
HaoOrlin
- the target needn't to be the last in its bucket
- proper size of container (if each node starts in different buckets initially)
kpeter [Mon, 06 Oct 2008 15:08:17 +0000] rev 2623
Add missing pointer initializing in min cost flow classes