Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142189 | Operations Research Letters | 2014 | 5 Pages |
Abstract
Minimizing a convex function over the integral points of a bounded convex set is polynomial in fixed dimension (Grötschel et al., 1988). We provide an alternative, short, and geometrically motivated proof of this result. In particular, we present an oracle-polynomial algorithm based on a mixed integer linear optimization oracle.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Timm Oertel, Christian Wagner, Robert Weismantel,