COIN-OR::LEMON - Graph Library

Version 81 (modified by Alpar Juttner, 13 years ago) (diff)

--

News

  • Aug 8, 2011
    LEMON 1.2.2, 1.1.4 and 1.0.7 released
    Maintenance releases. Please visit the NEWS(1.2.2), NEWS(1.1.4) and NEWS(1.0.7) files for more details on the changes
  • Sep 21, 2010
    LEMON 1.2.1, 1.1.3 and 1.0.6 released
    Maintenance releases. Please visit the NEWS(1.2.1), NEWS(1.1.3) and NEWS(1.0.6) files for more details on the changes.
  • Mar 19, 2010
    LEMON 1.2 released
    Major release with several new features and improvements. Please visit the NEWS file for more details.
  • Mar 8, 2010
    LEMON 1.1.2 and 1.0.5 released
    Minor bugfix releases. Please visit the NEWS(1.1.2) and NEWS(1.0.5) files for more details on the changes.
  • Oct 3, 2009
    LEMON 1.1.1 released
    Bugfix release for version 1.1. Please visit the NEWS file for more details on the changes.
  • Jun 25, 2009
    LEMON project template
    This template allows you to easily set up your own LEMON based project. Click here for more details.

... more news

Welcome to COIN-OR::LEMON

LEMON stands for Library for Efficient Modeling and Optimization in Networks. It is a C++ template library providing efficient implementations of common data structures and algorithms with focus on combinatorial optimization tasks connected mainly with graphs and networks.

LEMON is a member of the COIN-OR initiative, a collection of OR related open source projects. You are free to use it in your commercial or non-commercial applications under very permissive license terms.

The project was launched by the Egerváry Research Group on Combinatorial Optimization (EGRES) at the Department of Operations Research, Eötvös Loránd University, Budapest, Hungary in 2003. Up to this point, the developers of the library work at the Eötvös Loránd University, Budapest and at the Budapest University of Technology and Economics.

Starting Points

Related Projects

Sponsors

EGRES ETIK MIK Ericsson