Te Chiang Hu (Chinese: 胡德强, 1930–2021) was a Chinese-American computer scientist and operations researcher known for his work in the design and analysis of algorithms. His contributions to network flow problems included the representation of all pairwise flows using the Gomory–Hu tree,[GH61] the formulation of the multi-commodity flow problem,[H63] and a textbook on flow problems.[HY69][1] He also published highly cited algorithms for scheduling tree-structured tasks,[H61a] the widest path problem,[H61b] optimal binary search trees,[HT71] linear layouts of trees and graphs,[AH73] minimum routing cost spanning trees,[H74] and the matrix chain multiplication problem.[HS82]