Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Integer convex minimization by mixed integer linear optimization

Oertel, Timm, Wagner, Christian and Weismantel, Robert 2014. Integer convex minimization by mixed integer linear optimization. Operations Research Letters 42 (6-7) , pp. 424-428. 10.1016/j.orl.2014.07.005

PDF - Submitted Pre-Print Version
Download (282kB) | Preview


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.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Mathematics
Subjects: Q Science > QA Mathematics
Publisher: Elsevier
ISSN: 0167-6377
Date of Acceptance: 16 July 2014
Last Modified: 10 Mar 2020 20:11

Citation Data

Cited 14 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item


Downloads per month over past year

View more statistics