Mercuriallemon-main / file revision
summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset | file | latest | revisions | annotate | diff | comparison | raw | help
doc/mainpage.dox
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 12 Nov 2009 23:26:13 +0100
changeset 806 fa6f37d7a25b
parent 658 ebdcc68fe79e
child 848 e05b2b48515a
permissions -rw-r--r--
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 /* -*- mode: C++; indent-tabs-mode: nil; -*-

     2  *

     3  * This file is a part of LEMON, a generic C++ optimization library.

     4  *

     5  * Copyright (C) 2003-2009

     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).

     8  *

     9  * Permission to use, modify and distribute this software is granted

    10  * provided that this copyright notice appears in all copies. For

    11  * precise terms see the accompanying LICENSE file.

    12  *

    13  * This software is provided "AS IS" with no warranty of any kind,

    14  * express or implied, and with no claim as to its suitability for any

    15  * purpose.

    16  *

    17  */

    18 

    19 /**

    20 \mainpage LEMON Documentation

    21 

    22 \section intro Introduction

    23 

    24 <b>LEMON</b> stands for <i><b>L</b>ibrary for <b>E</b>fficient <b>M</b>odeling

    25 and <b>O</b>ptimization in <b>N</b>etworks</i>.

    26 It is a C++ template library providing efficient implementation of common

    27 data structures and algorithms with focus on combinatorial optimization

    28 problems in graphs and networks.

    29 

    30 <b>

    31 LEMON is an <a class="el" href="http://opensource.org/">open&nbsp;source</a>

    32 project.

    33 You are free to use it in your commercial or

    34 non-commercial applications under very permissive

    35 \ref license "license terms".

    36 </b>

    37 

    38 The project is maintained by the 

    39 <a href="http://www.cs.elte.hu/egres/">Egerv&aacute;ry Research Group on

    40 Combinatorial Optimization</a> \ref egres

    41 at the Operations Research Department of the

    42 <a href="http://www.elte.hu/">E&ouml;tv&ouml;s Lor&aacute;nd University,

    43 Budapest</a>, Hungary.

    44 LEMON is also a member of the <a href="http://www.coin-or.org/">COIN-OR</a>

    45 initiative \ref coinor.

    46 

    47 \section howtoread How to Read the Documentation

    48 

    49 If you would like to get to know the library, see

    50 <a class="el" href="http://lemon.cs.elte.hu/pub/tutorial/">LEMON Tutorial</a>.

    51 

    52 If you know what you are looking for, then try to find it under the

    53 <a class="el" href="modules.html">Modules</a> section.

    54 

    55 If you are a user of the old (0.x) series of LEMON, please check out the

    56 \ref migration "Migration Guide" for the backward incompatibilities.

    57 */
lemon-main