Gaffke, N.; Pukelsheim, F. - In: Mathematical Methods of Operations Research 67 (2008) 1, pp. 133-159
The problems of (bi-)proportional rounding of a nonnegative vector or matrix, resp., are written as particular separable convex integer minimization problems. Allowing any convex (separable) objective function we use the notions of vector and matrix apportionment problems. As a broader class of...
