Interfaces, Vol. 20, No. 4, The Practice of Mathematical Programming (Jul. - Aug., 1990), pp. 133-149 (17 pages) The auction algorithm is an intuitive method for solving the classical assignment ...

It is known that minimum cost flow problems can be solved by successive augmentations along shortest paths. In this paper the issues of implementing shortest path algorithms in this context are ...

Network flow watermarking is an advanced technique that embeds covert information into the characterising features of network traffic flows. By subtly modifying timing characteristics such as ...