This paper discusses new analytic algorithms and software for the enumeration of all integer flows inside a network. Concrete applications abound in graph theory \cite{Jaeger}, representation theory \cite{kirillov}, and statistics \cite{persi}. Our methods clearly surpass traditional exhaustive enumeration and other algorithms and can even yield formulas when the input data contains some parameters. These methods are based on the study of rational functions with poles on arrangements of hyperplanes.
@article{arxiv.math/0303228,
title = {Counting Integer flows in Networks},
author = {W. Baldoni-Silva and J. A. De Loera and M. Vergne},
journal= {arXiv preprint arXiv:math/0303228},
year = {2007}
}