[sci.math] Network flow problem

sshankar@cs.umn.edu (Subash Shankar) (09/21/90)

Take the standard max flow problem for directed graphs, where edges
have both minimum and maximum capacities.  This is easily reducible to
the standard max flow problem through standard methods.

Now, add some edges which may have flows of either 0 or some
pre-defined integer (say, 0 or f).  Can this be reduced to the max
flow problem?

I'd appreciate any pointers to any solutions to this problem.