Uniform and monotone line sum optimization

From MaRDI portal
Publication:2028097



Abstract: The {em 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 {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.











This page was built for publication: Uniform and monotone line sum optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028097)