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