Thu, 13 Nov 2008 16:17:50 +0000Various improvements in NetworkSimplex.
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.

Thu, 13 Nov 2008 15:29:04 +0000Improved constructors for min cost flow classes
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

Thu, 13 Nov 2008 10:54:42 +0000Improve tree update procedure in NetworkSimplex
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.

Fri, 07 Nov 2008 20:15:10 +0000Backport doxygen options for version 1.5.7 from [9194a12c52e6]
kpeter [Fri, 07 Nov 2008 20:15:10 +0000] rev 2627
Backport doxygen options for version 1.5.7 from [9194a12c52e6]

Thu, 23 Oct 2008 16:49:06 +0000Adapt the doc generation to the hg repo
alpar [Thu, 23 Oct 2008 16:49:06 +0000] rev 2626
Adapt the doc generation to the hg repo

Wed, 15 Oct 2008 12:04:11 +0000Major improvement in the cost scaling algorithm
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.