Maximum flow problem - WikipediaFlow network for the problem: Each human (ri) is willing to adopt a cat (wi1) and/or a dog (wi2). However each pet (pi) has a preference for only a subset of the humans. Find any matching of pets to humans such that the maximum number of pets are adopted by one of its preferred humans. In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains
