<P> In optimization theory, maximum flow problems involve finding a feasible flow through a single - source, single - sink flow network that is maximum . </P> <P> The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem . The maximum value of an s-t flow (i.e., flow from source s to sink t) is equal to the minimum capacity of an s-t cut (i.e., cut severing s from t) in the network, as stated in the max - flow min - cut theorem . </P> <P> The maximum flow problem was first formulated in 1954 by T.E. Harris and F.S. Ross as a simplified model of Soviet railway traffic flow . In 1955, Lester R. Ford, Jr. and Delbert R. Fulkerson created the first known algorithm, the Ford--Fulkerson algorithm . </P>

Does the maximum flow problem always have a unique solution