alpar [Wed, 16 Aug 2006 14:24:20 +0000] rev 2657
Some updates on the todo list
alpar [Mon, 14 Aug 2006 15:19:18 +0000] rev 2656
Remove superfluous include headers
alpar [Thu, 10 Aug 2006 14:56:36 +0000] rev 2655
Some clean files added.
alpar [Wed, 19 Jul 2006 13:08:10 +0000] rev 2654
Update ToDo list
alpar [Wed, 05 Jul 2006 17:13:08 +0000] rev 2653
Some update on documenting exceptions.
ladanyi [Tue, 04 Jul 2006 19:02:15 +0000] rev 2652
Distribute Makefiles.
ladanyi [Tue, 04 Jul 2006 18:54:34 +0000] rev 2651
Distribute Doxyfile.in and lemon.pc.in.
ladanyi [Tue, 04 Jul 2006 12:00:02 +0000] rev 2650
Set svn:ignore property.
ladanyi [Tue, 04 Jul 2006 11:58:39 +0000] rev 2649
The distcheck and doc targets should work now too.
ladanyi [Tue, 04 Jul 2006 10:21:38 +0000] rev 2648
Set svn:ignore property.
ladanyi [Tue, 04 Jul 2006 10:06:24 +0000] rev 2647
Copied the autotools files from trunk and commented them out so that configure and make succeeds.
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
deba [Sun, 05 Oct 2008 20:08:13 +0000] rev 2622
Fix _setCoeff
kpeter [Sun, 05 Oct 2008 13:46:07 +0000] rev 2621
Bug fix in min_cost_flow_test.cc
kpeter [Sun, 05 Oct 2008 13:37:17 +0000] rev 2620
Doc improvements
kpeter [Sun, 05 Oct 2008 13:36:43 +0000] rev 2619
Improve network simplex algorithm
- Remove "Limited Search" and "Combined" pivot rules.
- Add a new pivot rule "Altering Candidate List".
- Make the edge selection faster in every pivot rule.
- Set the default rule to "Block Search".
- Doc improvements.
The algorithm became about 15-35 percent faster on various input files.
"Block Search" pivot rule proved to be by far the fastest on all inputs.
deba [Fri, 19 Sep 2008 15:14:41 +0000] rev 2618
G++-4.3 compatibility changes
deba [Tue, 22 Jul 2008 11:29:57 +0000] rev 2617
Backport bug fix for Id handling from hg changeset [e67acd83a9ca]
deba [Tue, 22 Jul 2008 11:20:06 +0000] rev 2616
Back port bug fix from hg changeset [0915721396dc]
ladanyi [Wed, 02 Jul 2008 12:37:47 +0000] rev 2615
Fix bug caused by m4 consuming pairs of square brackets (#108).
alpar [Fri, 27 Jun 2008 06:37:14 +0000] rev 2614
Update the version number
deba [Fri, 13 Jun 2008 09:51:45 +0000] rev 2613
Back porting hg commit 81563e019fa4
deba [Tue, 10 Jun 2008 11:36:17 +0000] rev 2612
Bug fix initialization
The std::numeric_limits<double>::min() means the smallest positive number,
and not the smallest number in the whole range of double.
deba [Sun, 25 May 2008 16:35:05 +0000] rev 2611
Fixing bug in named parameters (Back port bug fix of ticket #95)
deba [Fri, 23 May 2008 10:55:41 +0000] rev 2610
Bug fix full graph problam