Integer convex minimization by mixed integer linear optimization

DOI10.1016/j.orl.2014.07.005zbMath1408.90202OpenAlexW2018869164MaRDI QIDQ1785273

Christian Wagner, Robert Weismantel, Timm Oertel

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://orca.cf.ac.uk/86766/1/IntegerConvexMinRev4.pdf

zbMATH Keywords

polynomial algorithmconvex minimizationinteger optimization

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11)

Related Items

Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice, Minimization of even conic functions on the two-dimensional integral lattice, Integer programming in parameterized complexity: five miniatures, On efficient algorithms for finding efficient salvo policies, A polynomial algorithm for minimizing discrete convic functions in fixed dimension, On the complexity of quasiconvex integer minimization problem, Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube, Complexity of optimizing over the integers, Integer Programming in Parameterized Complexity: Three Miniatures., Centerpoints: A Link between Optimization and Convex Geometry, Parameterized shifted combinatorial optimization, Unnamed Item, The (not so) trivial lifting in two dimensions, Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting, Unnamed Item

Uses Software

• Voronoi

Cites Work

• Unnamed Item
• Unnamed Item
• Partitions of mass-distributions and of convex bodies by hyperplanes
• Triangulations. Structures for algorithms and applications
• Ellipsoids of maximal volume in convex bodies
• Geometric algorithms and combinatorial optimization
• Introductory lectures on convex optimization. A basic course.
• Integer optimization on convex semialgebraic sets
• Complexity of integer quasiconvex polynomial optimization
• Integer Programming with a Fixed Number of Variables
• The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
• Convex and Discrete Geometry
• Solving convex programs by random walks