Fair Integral Network Flows

A strongly polynomial algorithm is developed for finding an integer-valued feasible st-flow of a given flow amount, which decreasingly minimal on specified subset F edges in the sense that largest value as small possible; within this, second third possible, and so on. characterization set these st-flows gives rise to compute cheapest F-decreasingly amount. Decreasing minimality possible formal way capture intuitive notion fairness.