[Lemon-announce] COIN-OR::LEMON 1.1 released

[LEMON Announce]

COIN-OR::LEMON 1.1 released
===========================

The LEMON development team proudly announces COIN-OR::LEMON 1.1, the
next major release of the library. The sources, binary packages and
the documentation can be downloaded from

http://lemon.cs.elte.hu

About COIN-OR::LEMON
====================

LEMON is an open source C++ template library aimed at combinatorial
optimization tasks, especially those working with graphs and
networks. Its goal is to provide highly efficient, easy-to-use, and
well cooperating fundamental software components that help
implementing complex real-life optimization tasks. These components
include graph implementations and related data structures, fundamental
graph and network algorithms (such as graph search, shortest path,
spanning tree and network flow algorithms) and various auxiliary
tools.

Both its design and the permissive licensing scheme target the
production/commercial use as well as research purposes.

A significant effort has been made to support a wide range of
operating systems and compilers. It is tested with Linux, Windows, OSX
and AIX systems and with the following compilers: GCC, Intel
C++, IBM xlC, Visual C++ 2005 and 2008.

LEMON is a member of the COIN-OR initiative, a collection of
operations research related open source projects.

What is new in LEMON 1.1
========================

* New algorithms
  * Connectivity related algorithms (#61)
  * Euler walks (#65)
  * Preflow push-relabel max. flow algorithm (#176)
  * Circulation algorithm (push-relabel based) (#175)
  * Suurballe algorithm (#47)
  * Gomory-Hu algorithm (#66)
  * Hao-Orlin algorithm (#58)
  * Edmond's maximum cardinality and weighted matching algorithms
    in general graphs (#48,#265)
  * Minimum cost arborescence/branching (#60)
  * Network Simplex min. cost flow algorithm (#234)
* New data structures
  * Full graph structure (#57)
  * Grid graph structure (#57)
  * Hypercube graph structure (#57)
  * Graph adaptors (#67)
  * ArcSet and EdgeSet classes (#67)
  * Elevator class (#174)
* Other new tools
  * LP/MIP interface (#44)
    * Support for GLPK, CPLEX, Soplex, COIN-OR CLP and CBC
  * Reader for the Nauty file format (#55)
  * DIMACS readers (#167)
  * Radix sort algorithms (#72)
  * RangeIdMap and CrossRefMap (#160)
* New command line tools
  * DIMACS to LGF converter (#182)
  * lgf-gen - a graph generator (#45)
  * DIMACS solver utility (#226)
* Other code improvements
  * Lognormal distribution added to Random (#102)
  * Better (i.e. O(1) time) item counting in SmartGraph (#3)
  * The standard maps of graphs are guaranteed to be
    reference maps (#190)
* Miscellaneous
  * Various doc improvements
  * Improved 0.x -> 1.x converter script
* Much improved MS Windows support
  * Various improvements in the CMAKE build system
  * Compilation warnings are fixed/suppressed
* Support IBM xlC compiler
* Several bugfixes