6 citations · 7 across the 4 of their papers we have counts for
4 papers
Integrality Gaps of Integer Knapsack Problems
Iskander Aliev, Martin Henk, Timm Oertel
We obtain optimal lower and upper bounds for the (additive) integrality gaps of integer knapsack problems. In a randomised setting, we show that the integrality gap of a "typical"…
Duality for Mixed-Integer Convex Minimization
Michel Baes, Timm Oertel, Robert Weismantel
We extend in two ways the standard Karush-Kuhn-Tucker optimality conditions to problems with a convex objective, convex functional constraints, and the extra requirement that some…
Note on the Complexity of the Mixed-Integer Hull of a Polyhedron
Robert Hildebrand, Timm Oertel, Robert Weismantel
We study the complexity of computing the mixed-integer hull of a polyhedron . Given an inequality description, with on…
Convex integer minimization in fixed dimension
Timm Oertel, Christian Wagner, Robert Weismantel
We show that minimizing a convex function over the integer points of a bounded convex set is polynomial in fixed dimension.