Running summarizing tools on a new article

Check the paper below, then start its synthesis.


Integer Convex Maximization

J. De Loera, R. Hemmecke, S. Onn, U. G. Rothblum, R. Weismantel

License: not stated (all rights reserved)

Abstract: We show that an important broad class of integer programming problems in variable dimension with convex objective functions is solvable in polynomial time, and discuss various applications including to multiway transportation problems, packing problems and partitioning problems.

Submitted to arXiv on 01 Sep. 2006