Title of the course:
LEMON library: solving optimization problems in
C++
(D72)
Number of contact hours per week:
Credit value:
Course coordinator(s):
Department(s):
Evaluation:
Prerequisites:
0+2
3
Alpár Jüttner
Department of Operations Research
Implementing an optimization algorithm.
A short description of the course:
LEMON is an open source software library for solving graph and network optimization
related algorithmic problems in C++. The aim of this course is to get familiar with the
structure and usage of this tool, through solving optimization tasks. The audience also have
the opportunity to join to the development of the library itself.
Textbook: none
Further reading:
http://lemon.cs.elte.hu
Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows. Prentice Hall,
1993.
W.J. Cook, W.H. Cunningham, W. Puleyblank, and A. Schrijver. Combinatorial
Optimization. Series in Discrete Matehematics and Optimization. Wiley-Interscience, Dec
1997.
A. Schrijver. Combinatorial Optimization - Polyhedra and Efficiency. Springer-Verlag,
Berlin, Series: Algorithms and Combinatorics , Vol. 24, 2003