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
deba [Fri, 16 May 2008 12:28:23 +0000] rev 2609
Fixing lp constraints (solving ticket #92)
alpar [Sat, 19 Apr 2008 13:04:51 +0000] rev 2608
Avoid warning in random.h (backport of chgset 4790635473ef from lemon-1.0)
kpeter [Thu, 17 Apr 2008 21:46:06 +0000] rev 2607
Remove SspMinCostFlow, since it is fully replaced by other classes.
kpeter [Thu, 17 Apr 2008 21:28:21 +0000] rev 2606
Revert mistaken changes in NEWS file.
deba [Tue, 08 Apr 2008 16:01:28 +0000] rev 2605
Bug fixes in LP solvers
- the copyLp is clarified
- newLp and copyLp gives back pointers
- cplex gives back empty string for variables without name
- cplex row and column retrieval
- added macro for soplex
deba [Tue, 08 Apr 2008 15:16:16 +0000] rev 2604
Fix Makefile.am
kpeter [Tue, 08 Apr 2008 14:43:44 +0000] rev 2603
Small fixes in NEWS file
hegyi [Tue, 08 Apr 2008 11:39:40 +0000] rev 2602
Rel.07 NEWS - 3. round
hegyi [Tue, 08 Apr 2008 11:38:17 +0000] rev 2601
Rel.07 NEWS - 2. round
hegyi [Mon, 07 Apr 2008 16:28:20 +0000] rev 2600
NEWS file updated for Release 0.7
alpar [Thu, 03 Apr 2008 12:06:48 +0000] rev 2599
Serious bugfix in Random::gamma()
Backport from hg b6bede534255
deba [Tue, 25 Mar 2008 16:28:06 +0000] rev 2598
Minor bug fix
deba [Thu, 20 Mar 2008 16:57:12 +0000] rev 2597
Correcting broken repo
deba [Thu, 20 Mar 2008 16:25:47 +0000] rev 2596
Back porting commit 81563e019fa4
deba [Thu, 20 Mar 2008 11:38:01 +0000] rev 2595
Bug fix for not connected graphs
deba [Fri, 14 Mar 2008 14:50:04 +0000] rev 2594
Executable property removed
kpeter [Fri, 07 Mar 2008 00:24:23 +0000] rev 2593
Fix static member initializations (ticket #30).
ladanyi [Sun, 02 Mar 2008 22:55:27 +0000] rev 2592
Revert to long long int since currently I don't know a better solution.
ladanyi [Sat, 01 Mar 2008 20:09:40 +0000] rev 2591
In C++98 array size shall be an integral constant expression. Fixes
ticket 12.
ladanyi [Sat, 01 Mar 2008 20:07:29 +0000] rev 2590
There is no 'long long int' type in C++98 (only in C99).
kpeter [Fri, 29 Feb 2008 16:09:29 +0000] rev 2589
Bug fix in CapacityScaling.
kpeter [Fri, 29 Feb 2008 15:57:52 +0000] rev 2588
Small improvements in min cost flow files.
kpeter [Fri, 29 Feb 2008 15:55:39 +0000] rev 2587
External flow and potential maps can be used in MinCostMaxFlow.
kpeter [Fri, 29 Feb 2008 15:55:13 +0000] rev 2586
Reimplemented Suurballe class.
- The new version is the specialized version of CapacityScaling.
- It is about 10-20 times faster than the former Suurballe algorithm
and about 20-50 percent faster than CapacityScaling.
- Doc improvements.
- The test file is also replaced.
deba [Thu, 28 Feb 2008 16:33:40 +0000] rev 2585
Backport of bug fix hg 2de55e4f57a7
kpeter [Thu, 28 Feb 2008 02:58:26 +0000] rev 2584
Test file for the min cost flow algorithms.
kpeter [Thu, 28 Feb 2008 02:57:36 +0000] rev 2583
Small fixes and doc improvements in MinMeanCycle.
kpeter [Thu, 28 Feb 2008 02:55:23 +0000] rev 2582
Avoid map copy in MinCostMaxFlow.
kpeter [Thu, 28 Feb 2008 02:54:27 +0000] rev 2581
Query improvements in the min cost flow algorithms.
- External flow and potential maps can be used.
- New query functions: flow() and potential().
- CycleCanceling also provides dual solution (node potentials).
- Doc improvements.
deba [Wed, 27 Feb 2008 11:39:03 +0000] rev 2580
Bug fixes