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.