The min-cut problem is significant in network flow optimization because it helps identify the minimum capacity needed to separate two sets of nodes in a network. This information is crucial for optimizing the flow of resources through a network efficiently.