# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1363439393 -3600
# Node ID 4f9a45a6d6f086ad942f1f1a49edbee9d1fb3d47
# Parent d9d1cb759951324f44b4060c92ce0993c6b0b382
Add references to papers related to LEMON (#459)
diff --git a/doc/groups.dox b/doc/groups.dox
a
|
b
|
|
428 | 428 | (capacities, supply values, and costs), except for \ref CapacityScaling, |
429 | 429 | which is capable of handling real-valued arc costs (other numerical |
430 | 430 | data are required to be integer). |
| 431 | |
| 432 | For more details about these implementations and for a comprehensive |
| 433 | experimental study, see the paper \ref KiralyKovacs12MCF. |
| 434 | It also compares these codes to other publicly available |
| 435 | minimum cost flow solvers. |
431 | 436 | */ |
432 | 437 | |
433 | 438 | /** |
diff --git a/doc/mainpage.dox.in b/doc/mainpage.dox.in
a
|
b
|
|
25 | 25 | and <b>O</b>ptimization in <b>N</b>etworks</i>. |
26 | 26 | It is a C++ template library providing efficient implementations of common |
27 | 27 | data structures and algorithms with focus on combinatorial optimization |
28 | | tasks connected mainly with graphs and networks. |
| 28 | tasks connected mainly with graphs and networks \ref DezsoJuttnerKovacs11Lemon. |
29 | 29 | |
30 | 30 | <b> |
31 | 31 | LEMON is an <a class="el" href="http://opensource.org/">open source</a> |
diff --git a/doc/references.bib b/doc/references.bib
a
|
b
|
|
22 | 22 | } |
23 | 23 | |
24 | 24 | |
| 25 | %%%%% Papers related to LEMON %%%%% |
| 26 | |
| 27 | @article{DezsoJuttnerKovacs11Lemon, |
| 28 | author = {B. Dezs{\H o} and A. J\"uttner and P. Kov\'acs}, |
| 29 | title = {{LEMON} -- an open source {C++} graph template library}, |
| 30 | journal = {Electronic Notes in Theoretical Computer Science}, |
| 31 | volume = {264}, |
| 32 | pages = {23--45}, |
| 33 | year = {2011}, |
| 34 | note = {Proc. 2nd Workshop on Generative Technologies} |
| 35 | } |
| 36 | |
| 37 | @article{KiralyKovacs12MCF, |
| 38 | author = {Z. Kir\'aly and P. Kov\'acs}, |
| 39 | title = {Efficient implementations of minimum-cost flow algorithms}, |
| 40 | journal = {Acta Universitatis Sapientiae, Informatica}, |
| 41 | year = {2012}, |
| 42 | volume = {4}, |
| 43 | pages = {67--118} |
| 44 | } |
| 45 | |
| 46 | |
25 | 47 | %%%%% Other libraries %%%%%% |
26 | 48 | |
27 | 49 | @misc{boost, |