Abstract
The line sum optimization problem asks for a (0, 1)-matrix minimizing the sum of given functions evaluated at its row and column sums. We show that the uniform problem, with identical row functions and identical column functions, and the monotone problem, over matrices with nonincreasing row and column sums, are polynomial time solvable. (C) 2021 Elsevier B.V.
All rights reserved.