tags/flowDavid Bremnerby-nc-sa-2.5
Copyright 2020, David Bremner
https://www.cs.unb.ca/~bremner//tags/flow/David Bremnerikiwiki2019-09-11T12:47:48ZNetwork flow exampleshttps://www.cs.unb.ca/~bremner//teaching/old/cs6375/examples/flow1/
<a href="../../whyCC/">by-nc-sa-2.5</a>
Copyright 2020, David Bremner
2019-09-11T12:47:48Z2012-09-12T03:00:00Z
<ul>
<li><p>Here is the <a href="https://www.cs.unb.ca/~bremner//teaching/old/cs6375/files/flow1.mod">simple flow example</a> we discussed in
class. <a href="https://www.cs.unb.ca/~bremner//teaching/old/cs6375/files/flow1.lp">LP format</a></p></li>
<li><p>Here is the <a href="https://www.cs.unb.ca/~bremner//teaching/old/cs6375/files/flow2.mod">a slightly fancier example</a> from the
glpk source. The original example was a directed flow; this has
been brutally symmetrized (to make it consistent with the undirected
flows in our book) by adding reverse arcs. A
<a href="https://www.cs.unb.ca/~bremner//teaching/old/cs6375/files/flow3.mod">less inefficient symmetrization</a> simply changes
the capacity constraints. There is also a
<a href="https://www.cs.unb.ca/~bremner//teaching/old/cs6375/files/flow2.dot">dot drawing</a> of the network and the
<a href="https://www.cs.unb.ca/~bremner//teaching/old/cs6375/files/residual2.dot">residual graph</a>.</p></li>
</ul>