Changes between Initial Version and Version 1 of Ticket #222
- Timestamp:
- 02/16/09 03:08:12 (15 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
Ticket #222 – Description
initial v1 1 A simpler (but in fact equivalent) form of the Network Flow Problems when we have onupper limit on the arcs. We can also assume that the lower limit is 0 everywhere.1 A simpler (but in fact equivalent) form of the Network Flow Problems when we have no upper limit on the arcs. We can also assume that the lower limit is 0 everywhere. 2 2 3 3 In this case Network Simplex algorithms becomes much easier:
