We consider the maximum generalised network flow problem and a supply-scaling algorithmic framework for this problem. We present three network-modification operations, which may significantly decrease the size of the network when the remaining node supplies become small. We use these three operations in Goldfarb, Jin and Orlin’s supply-scaling algorithm and prove a Õ(m 2 n log B) bound on the running time of the resulting algorithm. The previous best time bounds on computing maximum generalised flows were the O(m 1.5 n 2 log B) bound of Kapoor and Vaidya’s algorithm based on the interior-point method, and the Õ(m 3 log B) bound of Goldfarb, Jin and Orlin’s algorithm.