The maximum flow problem is one of the classic combinatorial optimization problems with many applications, such as electrical powers, traffics, communications, computer networks and logistics.
The problem is to find a flow of maximum value on a network from a source to a sink. Ordered binary decision diagram (OBDD) is a canonical form to represent and manipulate the Boolean functions efficiently.