Integer convex minimization by mixed integer linear optimization
type: Item
instance of: scholarly article
title: Integer convex minimization by mixed integer linear optimization
zbMATH Open document ID: 1408.90202
author: Timm Oertel
author: Christian Wagner
author: Robert Weismantel
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
full work available at URL: IntegerConvexMinRev4.pdf
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6945293
zbMATH Keywords: convex minimization
zbMATH Keywords: integer optimization
zbMATH Keywords: polynomial algorithm
describes a project that uses: Voronoi
MaRDI profile type: Publication
OpenAlex ID: W2018869164
cites work: Ellipsoids of maximal volume in convex bodies
cites work: The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
cites work: Solving convex programs by random walks
cites work: Triangulations. Structures for algorithms and applications
cites work: Q4401010
cites work: Geometric algorithms and combinatorial optimization
cites work: Convex and Discrete Geometry
cites work: Partitions of mass-distributions and of convex bodies by hyperplanes
cites work: Complexity of integer quasiconvex polynomial optimization
cites work: Q5791470
cites work: Integer optimization on convex semialgebraic sets
cites work: Integer Programming with a Fixed Number of Variables
cites work: Introductory lectures on convex optimization. A basic course.
DOI: 10.1016/J.ORL.2014.07.005
description: scientific article; zbMATH DE number 6945293