Files @ r872:fa6f37d7a25b

Location: LEMON/LEMON-official/AUTHORS

Load file history 
r872:fa6f37d7a25b
937 B
text/plain
Show annotation Show as raw Download as raw
gravatar
kpeter (Peter Kovacs)
Entirely rework CapacityScaling (#180) - Use the new interface similarly to NetworkSimplex. - Rework the implementation using an efficient internal structure for handling the residual network. This improvement made the code much faster (up to 2-5 times faster on large graphs). - Handle GEQ supply type (LEQ is not supported). - Handle negative costs for arcs of finite capacity. (Note that this algorithm cannot handle arcs of negative cost and infinite upper bound, thus it returns UNBOUNDED if such an arc exists.) - Extend the documentation.
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
The authors of the 1.x series are



 * Balazs Dezso <deba@inf.elte.hu>

 * Alpar Juttner <alpar@cs.elte.hu>

 * Peter Kovacs <kpeter@inf.elte.hu>

 * Akos Ladanyi <ladanyi@tmit.bme.hu>



For more details on the actual contribution, please visit the history

of the main LEMON source repository: http://lemon.cs.elte.hu/hg/lemon



Moreover, this version is heavily based on the 0.x series of

LEMON. Here is the list of people who contributed to those versions.



 * Mihaly Barasz <klao@cs.elte.hu>

 * Johanna Becker <beckerjc@cs.elte.hu>

 * Attila Bernath <athos@cs.elte.hu>

 * Balazs Dezso <deba@inf.elte.hu>

 * Peter Hegyi <hegyi@tmit.bme.hu>

 * Alpar Juttner <alpar@cs.elte.hu>

 * Peter Kovacs <kpeter@inf.elte.hu>

 * Akos Ladanyi <ladanyi@tmit.bme.hu>

 * Marton Makai <marci@cs.elte.hu>

 * Jacint Szabo <jacint@cs.elte.hu>



Again, please visit the history of the old LEMON repository for more

details: http://lemon.cs.elte.hu/svn/lemon/trunk