In transportation theory, the term "minimum-cost flow problem" refers to an optimization problem that seeks to determine the most cost-effective way to transport goods through a network from multiple suppliers to multiple consumers while satisfying supply and demand constraints, minimizing the total transportation costs associated with the flow of goods along the network's edges.