AUTHORS
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 15 Nov 2012 07:17:48 +0100
changeset 1013 f6f6896a4724
parent 951 3dcb45a871c3
permissions -rw-r--r--
Ensure strongly polynomial running time for CycleCanceling (#436)
The number of iterations performed by Howard's algorithm is limited.
If the limit is reached, a strongly polynomial implementation,
HartmannOrlinMmc is executed to find a minimum mean cycle.
This iteration limit is typically not reached, thus the combined
method is practically equivalent to Howard's algorithm, while it
also ensures the strongly polynomial time bound.
alpar@992
     1
The main developers of release series 1.x 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@992
     8
For more complete list of contributors, please visit the history of
alpar@992
     9
the LEMON source code repository: http://lemon.cs.elte.hu/hg/lemon
alpar@320
    10
alpar@992
    11
Moreover, this version is heavily based on version 0.x of LEMON. Here
alpar@992
    12
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@951
    26
details: http://lemon.cs.elte.hu/hg/lemon-0.x