A strongly polynomial algorithm for the minimum cost tension problem Original Research Article

We propose a strongly polynomial algorithm for the minimum cost tension problem. Our algorithm is inspired by Goldberg and Tarjanʹs ideas which deal with the minimum cost circulation problem. It consists of repeatedly canceling minimum mean-cost residual cuts. Hence, we had to consider two other combinatorial optimization problems which possess interesting practical applications: the min-cost and min-mean-cost residual cut problems (Hadjiat and Maurras, 1995).