Definition: The property that the flow on every edge of a flow network is no more than the edge's capacity. More formally, for all edges e, f(e) ≤ u(e), where f(e) is the flow on e and u(e) is its capacity.
See also flow network.
Note: From Algorithms and Theory of Computation Handbook, page 7-10, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Tue Feb 12 10:57:42 2019.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "capacity constraint", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/capacitycstr.html