1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
3 * This file is a part of LEMON, a generic C++ optimization library.
5 * Copyright (C) 2003-2009
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
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.
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
20 \mainpage LEMON Documentation
22 \section intro Introduction
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.
31 LEMON is an <a class="el" href="http://opensource.org/">open source</a>
33 You are free to use it in your commercial or
34 non-commercial applications under very permissive
35 \ref license "license terms".
38 The project is maintained by the
39 <a href="http://www.cs.elte.hu/egres/">Egervá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ötvös Lorá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.
47 \section howtoread How to Read the Documentation
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>.
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.
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.