Integer convex minimization by mixed integer linear optimization

Oertel T, Wagner C, Weismantel R (2014)

Publication Type: Journal article

Publication year: 2014

Journal

Operations Research Letters Elsevier

Book Volume: 42

Pages Range: 424-428

Journal Issue: 6-7

DOI: 10.1016/j.orl.2014.07.005

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. © 2014 Elsevier B.V. All rights reserved.

Authors with CRIS profile

Timm Oertel

Additional Organisation(s)

Professur für Mathematische Analyse von Daten (Data Analytics)

Involved external institutions

Eidgenössische Technische Hochschule Zürich (ETHZ) / Swiss Federal Institute of Technology in Zurich CH Switzerland (CH)

How to cite

APA:

Oertel, T., Wagner, C., & Weismantel, R. (2014). Integer convex minimization by mixed integer linear optimization. Operations Research Letters, 42(6-7), 424-428. https://dx.doi.org/10.1016/j.orl.2014.07.005

MLA:

Oertel, Timm, Christian Wagner, and Robert Weismantel. "Integer convex minimization by mixed integer linear optimization." Operations Research Letters 42.6-7 (2014): 424-428.

BibTeX: Download