AUTHORS
author Peter Kovacs <kpeter@inf.elte.hu>
Fri, 17 Apr 2009 18:04:36 +0200
changeset 656 e6927fe719e6
child 1072 3dcb45a871c3
permissions -rw-r--r--
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.
alpar@320
     1
The authors of the 1.x series are
alpar@320
     2
alpar@320
     3
 * Balazs Dezso <deba@inf.elte.hu>
alpar@320
     4
 * Alpar Juttner <alpar@cs.elte.hu>
alpar@320
     5
 * Peter Kovacs <kpeter@inf.elte.hu>
alpar@320
     6
 * Akos Ladanyi <ladanyi@tmit.bme.hu>
alpar@320
     7
alpar@320
     8
For more details on the actual contribution, please visit the history
alpar@320
     9
of the main LEMON source repository: http://lemon.cs.elte.hu/hg/lemon
alpar@320
    10
alpar@320
    11
Moreover, this version is heavily based on the 0.x series of
alpar@320
    12
LEMON. Here is the list of people who contributed to those versions.
alpar@320
    13
alpar@320
    14
 * Mihaly Barasz <klao@cs.elte.hu>
alpar@320
    15
 * Johanna Becker <beckerjc@cs.elte.hu>
alpar@320
    16
 * Attila Bernath <athos@cs.elte.hu>
alpar@320
    17
 * Balazs Dezso <deba@inf.elte.hu>
alpar@320
    18
 * Peter Hegyi <hegyi@tmit.bme.hu>
alpar@320
    19
 * Alpar Juttner <alpar@cs.elte.hu>
alpar@320
    20
 * Peter Kovacs <kpeter@inf.elte.hu>
alpar@320
    21
 * Akos Ladanyi <ladanyi@tmit.bme.hu>
alpar@320
    22
 * Marton Makai <marci@cs.elte.hu>
alpar@320
    23
 * Jacint Szabo <jacint@cs.elte.hu>
alpar@320
    24
alpar@320
    25
Again, please visit the history of the old LEMON repository for more
alpar@320
    26
details: http://lemon.cs.elte.hu/svn/lemon/trunk