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