Uniform and Monotone Line Sum Optimization
arXiv:2011.09932
Abstract
The {\em line sum optimization problem} asks for a -matrix minimizing the sum of given functions evaluated at its row and column sums. We show that the {\em uniform} problem, with identical row functions and identical column functions, and the {\em monotone} problem, over matrices with nonincreasing row and column sums, are polynomial time solvable.