COPYING
author kpeter
Thu, 28 Feb 2008 02:54:27 +0000
changeset 2581 054566ac0934
parent 760 49d4fe04fbc0
permissions -rw-r--r--
Query improvements in the min cost flow algorithms.

- External flow and potential maps can be used.
- New query functions: flow() and potential().
- CycleCanceling also provides dual solution (node potentials).
- Doc improvements.
klao@922
     1
LEMON as a whole is copyrighted by Egerváry Jenő Kombinatorikus
alpar@760
     2
Optimalizálási Kutatócsoport (Egervary Combinatorial Optimization
alpar@760
     3
Research Group, EGRES).
klao@687
     4
klao@922
     5
You are free to use, modify and distribute LEMON under the terms
klao@687
     6
described in the LICENSE file.
klao@687
     7
alpar@760
     8
This project is supported by
klao@687
     9
alpar@760
    10
* Egyetemközi Távközlési és Informatikai Központ (Inter-University
alpar@760
    11
  Centre for Telecommunications and Informatics, Hungary)
alpar@760
    12
alpar@760
    13
* Traffic Analysis and Network Performance Laboratory,
alpar@760
    14
  Ericsson Research, Hungary
alpar@760
    15
alpar@760
    16
* Department of Operations Research, Eötvös Loránd University,
alpar@760
    17
  Budapest