Thu, 23 Apr 2009 07:28:56 +0100FindGLPK improvements (#256)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 23 Apr 2009 07:28:56 +0100] rev 619
FindGLPK improvements (#256)

Fri, 24 Apr 2009 12:12:14 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 24 Apr 2009 12:12:14 +0100] rev 618
Merge

Fri, 24 Apr 2009 11:54:48 +0200Fix and uniform the usage of Graph and Parent typedefs (#268)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 11:54:48 +0200] rev 617
Fix and uniform the usage of Graph and Parent typedefs (#268)

- Rename Graph typedefs to GraphType in the implementation of graph
maps and MapExtender to prevent conflicts (especially using VS).
They are not public.
- Make Parent typedefs private in all classes.
- Replace Digraph with Graph in some places
(fix faulty renamings of the script).
- Use Graph and Digraph typedefs (more) consequently.

Fri, 24 Apr 2009 10:15:33 +0200VS compatibility fix (#268)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 10:15:33 +0200] rev 616
VS compatibility fix (#268)

Fri, 24 Apr 2009 12:23:53 +0200Exploit the changes of #190 in MCF test file (#234, #190)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 12:23:53 +0200] rev 615
Exploit the changes of #190 in MCF test file (#234, #190)

Fri, 24 Apr 2009 12:23:17 +0200Support LEQ and GEQ supply constraints in dimacs-solver (#234, #219)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 12:23:17 +0200] rev 614
Support LEQ and GEQ supply constraints in dimacs-solver (#234, #219)

Fri, 24 Apr 2009 12:22:06 +0200Bug fix in NetworkSimplex (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 12:22:06 +0200] rev 613
Bug fix in NetworkSimplex (#234)

Thu, 23 Apr 2009 10:44:35 +0100Fix usage of sqrt() (#268)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 23 Apr 2009 10:44:35 +0100] rev 612
Fix usage of sqrt() (#268)

Tue, 21 Apr 2009 15:18:54 +0100Merge and fix
Alpar Juttner <alpar@cs.elte.hu> [Tue, 21 Apr 2009 15:18:54 +0100] rev 611
Merge and fix

Fri, 17 Apr 2009 18:14:35 +0200Slightly modify the interface of Circulation and Preflow (#266)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 17 Apr 2009 18:14:35 +0200] rev 610
Slightly modify the interface of Circulation and Preflow (#266)
in order to synchronize them to the interface of NetworkSimplex.

Circulation:
- The "delta" notation is replaced by "supply".
- lowerCapMap(), upperCapMap() are renamed to lowerMap() and upperMap().
- Value is renamed to Flow.

Preflow:
- Value is renamed to Flow.

Fri, 17 Apr 2009 18:04:36 +0200Support >= and <= constraints in NetworkSimplex (#219, #234)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 17 Apr 2009 18:04:36 +0200] rev 609
Support >= and <= constraints in NetworkSimplex (#219, #234)

By default the same inequality constraints are supported as by
Circulation (the GEQ form), but the LEQ form can also be selected
using the problemType() function.

The documentation of the min. cost flow module is reworked and
extended with important notes and explanations about the different
variants of the problem and about the dual solution and optimality
conditions.

Fri, 03 Apr 2009 18:59:15 +0200Support real types + numerical stability fix in NS (#254)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 03 Apr 2009 18:59:15 +0200] rev 608
Support real types + numerical stability fix in NS (#254)

- Real types are supported by appropriate inicialization.
- A feature of the XTI spanning tree structure is removed to ensure
numerical stability (could cause problems using integer types).
The node potentials are updated always on the lower subtree,
in order to prevent overflow problems.
The former method isn't notably faster during to our tests.

Fri, 03 Apr 2009 13:46:16 +0200Separate types for flow and cost values in NetworkSimplex (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 03 Apr 2009 13:46:16 +0200] rev 607
Separate types for flow and cost values in NetworkSimplex (#234)

Wed, 25 Mar 2009 21:37:50 +0100Support multiple run() calls in NetworkSimplex (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 25 Mar 2009 21:37:50 +0100] rev 606
Support multiple run() calls in NetworkSimplex (#234)

Wed, 25 Mar 2009 15:58:44 +0100Rework the interface of NetworkSimplex (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 25 Mar 2009 15:58:44 +0100] rev 605
Rework the interface of NetworkSimplex (#234)

The parameters of the problem can be set with separate functions
instead of different constructors.

Tue, 24 Mar 2009 00:18:25 +0100Use XTI implementation instead of ATI in NetworkSimplex (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 24 Mar 2009 00:18:25 +0100] rev 604
Use XTI implementation instead of ATI in NetworkSimplex (#234)

XTI (eXtended Threaded Index) is an imporved version of the widely
known ATI (Augmented Threaded Index) method for storing and updating
the spanning tree structure in Network Simplex algorithms.

In the ATI data structure three indices are stored for each node:
predecessor, thread and depth. In the XTI data structure depth is
replaced by the number of successors and the last successor
(according to the thread index).

Mon, 23 Mar 2009 23:54:42 +0100Internal restructuring and renamings in NetworkSimplex (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 23 Mar 2009 23:54:42 +0100] rev 603
Internal restructuring and renamings in NetworkSimplex (#234)

Tue, 24 Feb 2009 09:52:26 +0100Support min cost flow in dimacs-solver (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 24 Feb 2009 09:52:26 +0100] rev 602
Support min cost flow in dimacs-solver (#234)

Tue, 24 Feb 2009 09:46:02 +0100Port NetworkSimplex from SVN -r3520 (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 24 Feb 2009 09:46:02 +0100] rev 601
Port NetworkSimplex from SVN -r3520 (#234)

Tue, 21 Apr 2009 13:08:19 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 21 Apr 2009 13:08:19 +0100] rev 600
Merge

Tue, 21 Apr 2009 10:34:49 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 21 Apr 2009 10:34:49 +0100] rev 599
Merge

Sat, 18 Apr 2009 21:54:30 +0200Add more docs to LGF function interface (#109)
Balazs Dezso <deba@inf.elte.hu> [Sat, 18 Apr 2009 21:54:30 +0200] rev 598
Add more docs to LGF function interface (#109)

Sat, 18 Apr 2009 21:01:12 +0200Fix in HaoOrlin (#264)
Balazs Dezso <deba@inf.elte.hu> [Sat, 18 Apr 2009 21:01:12 +0200] rev 597
Fix in HaoOrlin (#264)

Wed, 15 Apr 2009 09:37:51 +0200Improvements and fixes for the minimum cut algorithms (#264)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 09:37:51 +0200] rev 596
Improvements and fixes for the minimum cut algorithms (#264)

Sat, 18 Apr 2009 08:51:54 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Sat, 18 Apr 2009 08:51:54 +0100] rev 595
Merge

Fri, 17 Apr 2009 09:58:50 +0200Rename max_matching.h to matching.h (#265)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 17 Apr 2009 09:58:50 +0200] rev 594
Rename max_matching.h to matching.h (#265)

Fri, 17 Apr 2009 09:54:14 +0200Extend and modify the interface of matching algorithms (#265)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 17 Apr 2009 09:54:14 +0200] rev 593
Extend and modify the interface of matching algorithms (#265)

- Rename decomposition() to status() in MaxMatching.
- Add a new query function statusMap() to MaxMatching.
- Add a new query function matchingMap() to all the three classes.
- Rename matchingValue() to matchingWeight() in the weighted
matching classes.

Wed, 15 Apr 2009 11:47:19 +0200Improvements for the Euler tools and the test file (#264)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 11:47:19 +0200] rev 592
Improvements for the Euler tools and the test file (#264)

Wed, 15 Apr 2009 11:41:25 +0200Bug fix in the Euler iterators (#264)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 11:41:25 +0200] rev 591
Bug fix in the Euler iterators (#264)
Handle the case when the first node is isolated.

Wed, 15 Apr 2009 12:01:14 +0200Imporvements for the matching algorithms (#264)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 12:01:14 +0200] rev 590
Imporvements for the matching algorithms (#264)

Wed, 15 Apr 2009 07:13:30 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 15 Apr 2009 07:13:30 +0100] rev 589
Merge

Wed, 15 Apr 2009 07:07:25 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 15 Apr 2009 07:07:25 +0100] rev 588
Merge

Wed, 15 Apr 2009 07:05:32 +0100Rotate and enlarge some images (#262)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 15 Apr 2009 07:05:32 +0100] rev 587
Rotate and enlarge some images (#262)

Wed, 15 Apr 2009 04:26:13 +0200Add images + fixes in the doc of connectivity tools (#262)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 04:26:13 +0200] rev 586
Add images + fixes in the doc of connectivity tools (#262)

Wed, 15 Apr 2009 03:26:45 +0200Improve test files for some algorithms (#263)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 03:26:45 +0200] rev 585
Improve test files for some algorithms (#263)

Wed, 15 Apr 2009 02:04:37 +0200Small doc improvements (#263)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 02:04:37 +0200] rev 584
Small doc improvements (#263)

Tue, 14 Apr 2009 10:40:33 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 14 Apr 2009 10:40:33 +0100] rev 583
Merge

Tue, 14 Apr 2009 10:54:42 +0200Remove notes about reference maps as extra features (#190)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 14 Apr 2009 10:54:42 +0200] rev 582
Remove notes about reference maps as extra features (#190)

Tue, 14 Apr 2009 10:35:38 +0200Exploit that the standard maps are reference maps (#190)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 14 Apr 2009 10:35:38 +0200] rev 581
Exploit that the standard maps are reference maps (#190)

Tue, 14 Apr 2009 10:34:12 +0200Standard graph maps are required to be reference maps (#190)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 14 Apr 2009 10:34:12 +0200] rev 580
Standard graph maps are required to be reference maps (#190)

Tue, 14 Apr 2009 10:33:17 +0200Various improvements and fixes (mainly in the doc) (#190)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 14 Apr 2009 10:33:17 +0200] rev 579
Various improvements and fixes (mainly in the doc) (#190)

Fri, 10 Apr 2009 07:29:22 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 10 Apr 2009 07:29:22 +0100] rev 578
Merge

Fri, 10 Apr 2009 07:29:00 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 10 Apr 2009 07:29:00 +0100] rev 577
Merge

Wed, 08 Apr 2009 22:49:28 +0200Unified message handling for LP and MIP solvers (#9)
Balazs Dezso <deba@inf.elte.hu> [Wed, 08 Apr 2009 22:49:28 +0200] rev 576
Unified message handling for LP and MIP solvers (#9)

Thu, 09 Apr 2009 21:19:16 +0200Force cplex checking (#260)
Balazs Dezso <deba@inf.elte.hu> [Thu, 09 Apr 2009 21:19:16 +0200] rev 575
Force cplex checking (#260)

Wed, 08 Apr 2009 10:42:00 +0200Add RangeIdMap, CrossRefMap to the rename script (#160)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 08 Apr 2009 10:42:00 +0200] rev 574
Add RangeIdMap, CrossRefMap to the rename script (#160)

Tue, 07 Apr 2009 14:50:20 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 07 Apr 2009 14:50:20 +0100] rev 573
Merge

Sat, 04 Apr 2009 07:30:58 +0100DescriptorMap->RangeIdMap, InvertableMap->CrossRefMap (#160)
Alpar Juttner <alpar@cs.elte.hu> [Sat, 04 Apr 2009 07:30:58 +0100] rev 572
DescriptorMap->RangeIdMap, InvertableMap->CrossRefMap (#160)

Tue, 07 Apr 2009 12:56:50 +0100Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 07 Apr 2009 12:56:50 +0100] rev 571
Merge

Mon, 06 Apr 2009 18:51:04 +0100Fix compilation with MSVC (#259)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 06 Apr 2009 18:51:04 +0100] rev 570
Fix compilation with MSVC (#259)

Mon, 06 Apr 2009 18:51:54 +0100Fix compilation with MSVC (#258)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 06 Apr 2009 18:51:54 +0100] rev 569
Fix compilation with MSVC (#258)

Fri, 03 Apr 2009 16:58:22 +0100Single check macro for all COIN-OR dependencies (#204)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Fri, 03 Apr 2009 16:58:22 +0100] rev 568
Single check macro for all COIN-OR dependencies (#204)

Wed, 01 Apr 2009 22:58:58 +0200Add CBC support (#204)
Balazs Dezso <deba@inf.elte.hu> [Wed, 01 Apr 2009 22:58:58 +0200] rev 567
Add CBC support (#204)

Thu, 02 Apr 2009 19:29:56 +0200Silent glp_adv_basis() (#255)
Balazs Dezso <deba@inf.elte.hu> [Thu, 02 Apr 2009 19:29:56 +0200] rev 566
Silent glp_adv_basis() (#255)

Wed, 01 Apr 2009 22:54:00 +0200Fixing presolver and basis handling (#255)
Balazs Dezso <deba@inf.elte.hu> [Wed, 01 Apr 2009 22:54:00 +0200] rev 565
Fixing presolver and basis handling (#255)

Wed, 01 Apr 2009 14:18:35 +0100Add 'demo' make target for building the demo programs
Akos Ladanyi <ladanyi@tmit.bme.hu> [Wed, 01 Apr 2009 14:18:35 +0100] rev 564
Add 'demo' make target for building the demo programs