debian/control
author kpeter
Sun, 05 Oct 2008 13:36:43 +0000
changeset 2619 30fb4d68b0e8
parent 1490 fa2b73784343
permissions -rw-r--r--
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.
     1 Source: lemon
     2 Section: unknown
     3 Priority: optional
     4 Maintainer: LEMON Development Team <etik-ol@cs.elte.hu>
     5 Build-Depends: debhelper (>= 4.0.0), glpk, libgnomecanvasmm-2.6-dev
     6 Standards-Version: 3.6.1
     7 
     8 Package: lemon
     9 Architecture: any
    10 Depends: ${shlibs:Depends}, ${misc:Depends}, libgnomecanvasmm-2.6
    11 Description: A C++ template library aimed at combinatorial optimization tasks.
    12  LEMON stands for Library of Efficient Models and
    13  Optimization in Networks. It is a C++ template
    14  library aimed at combinatorial optimization tasks,
    15  especially those working with graphs and networks.