/* -*- mode: C++; indent-tabs-mode: nil; -*- * * This file is a part of LEMON, a generic C++ optimization library. * * Copyright (C) 2003-2008 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES). * * Permission to use, modify and distribute this software is granted * provided that this copyright notice appears in all copies. For * precise terms see the accompanying LICENSE file. * * This software is provided "AS IS" with no warranty of any kind, * express or implied, and with no claim as to its suitability for any * purpose. * */ /** [PAGE]intro[PAGE] Introduction [SEC]intro_lemon[SEC] What is LEMON LEMON stands for Library of Efficient Models and Optimization in Networks. It is a C++ template library aimed at combinatorial optimization tasks, especially those working with graphs and networks. LEMON is an open source project. You are free to use it in your commercial or non-commercial applications under very permissive \ref license "license terms". This library helps to write programs that solve optimization problems that arise frequently when designing and testing certain networks, for example in telecommunication, computer networks, logistics, scheduling, and other areas. A very natural way of modelling these networks is by means of a graph. Generally if you want to write any program that works with graphs, then you might find it useful and convenient to use LEMON. For more information visit the LEMON web site: http://lemon.cs.elte.hu/. [SEC]intro_tutorial[SEC] LEMON Tutorial This tutorial introduces the reader to the basic concepts and features of LEMON, and there are also some sections about advanced topics showing the power of various tools implemented in the library. After getting familiar with the basics of the library, you may start using LEMON with the help of the detailed documentation (that can also be used as a reference manual). [TRAILER] */