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 ...

The solution technique includes a maximal-flow procedure and produces a 'min-cut equals max-flow' theorem for networks with gains. Additional features, such as piece-wise linear convex costs, ...

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 ...

SAS/OR software may be of interest to users of SAS/STAT software for its mathematical programming features. In particular, the NLP procedure in SAS/OR software solves nonlinear programming problems, ...

Flow processing is the ability for a communications application to keep active state on every individual network “conversation” traversing the device for the entire duration.