Oertel, Timm ORCID: https://orcid.org/0000-0001-5720-8978, 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 |
Preview |
PDF
- Submitted Pre-Print Version
Download (282kB) | Preview |
Official URL: http://dx.doi.org/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.
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: | 07 Nov 2023 02:33 |
URI: | https://orca.cardiff.ac.uk/id/eprint/86766 |
Citation Data
Cited 17 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
Edit Item |