Martin Henk

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 13

Top Topics

Integer Program

Top Venues

SIAM J. Discret. Math.

Publications

Iskander Aliev, Marcel Celaya, Martin Henk
Sparsity and Integrality Gap Transference Bounds for Integer Programs. IPCO (2024)
Martin Henk
Erratum to: "Densest Lattice Packings of 3-Polytopes" [Computational Geometry 16 (2000) 157-186]. Comput. Geom. 119 (2024)
Iskander Aliev, Martin Henk, Mark Hogan, Stefan Kuhlmann, Timm Oertel
New Bounds for the Integer Carathéodory Rank. SIAM J. Optim. 34 (1) (2024)
Katharina Eller, Martin Henk
On subspace concentration for dual curvature measures. Adv. Appl. Math. 151 (2023)
Marcel Celaya, Martin Henk
Proximity bounds for random integer programs. Math. Program. 197 (2) (2023)
Martin Henk, Stefan Kuhlmann, Robert Weismantel
On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases. SIAM J. Discret. Math. 36 (3) (2022)
Ansgar Freyer, Martin Henk
Bounds on the Lattice Point Enumerator via Slices and Projections. Discret. Comput. Geom. 67 (3) (2022)
Marcel Celaya, Martin Henk
Proximity Bounds for Random Integer Programs. IPCO (2021)
Iskander Aliev, Marcel Celaya, Martin Henk, Aled Williams
Distance-Sparsity Transference for Vertices of Corner Polyhedra. SIAM J. Optim. 31 (1) (2021)
Iskander Aliev, Martin Henk, Timm Oertel
Distances to lattice points in knapsack polyhedra. Math. Program. 182 (1) (2020)
Martin Henk
A Note on Lattice Packings via Lattice Refinements. Exp. Math. 27 (1) (2018)
Iskander Aliev, Martin Henk, Timm Oertel
Integrality Gaps of Integer Knapsack Problems. IPCO (2017)
Sören Lennart Berg, Martin Henk
Lattice Point Inequalities for Centered Convex Bodies. SIAM J. Discret. Math. 30 (2) (2016)
Iskander Aliev, Martin Henk, Eva Linke
Integer Points in Knapsack Polytopes and s-Covering Radius. Electron. J. Comb. 20 (2) (2013)
Iskander Aliev, Martin Henk
LLL-reduction for integer knapsacks. J. Comb. Optim. 24 (4) (2012)
Christian Bey, Martin Henk, Matthias Henze, Eva Linke
Notes on lattice points of zonotopes and lattice-face polytopes. Discret. Math. 311 (8-9) (2011)
Gennadiy Averkov, Martin Henk
polynomials. Math. Program. 126 (2) (2011)
Iskander Aliev, Martin Henk, Aicke Hinrichs
Expected Frobenius numbers. J. Comb. Theory, Ser. A 118 (2) (2011)
Iskander Aliev, Martin Henk
Feasibility of Integer Knapsacks. SIAM J. Optim. 20 (6) (2010)
Iskander Aliev, Martin Henk
Integer Knapsacks: Average Behavior of the Frobenius Numbers. Math. Oper. Res. 34 (3) (2009)
Gennadiy Averkov, Martin Henk
Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities. Discret. Comput. Geom. 42 (2) (2009)
Martin Henk, Makoto Tagami
Lower bounds on the coefficients of Ehrhart polynomials. Eur. J. Comb. 30 (1) (2009)
Christian Bey, Martin Henk, Jörg M. Wills
Notes on the Roots of Ehrhart Polynomials. Discret. Comput. Geom. 38 (1) (2007)
Hartwig Bosse, Martin Grötschel, Martin Henk
Polynomial inequalities representing polyhedra. Math. Program. 103 (1) (2005)
Martin Grötschel, Martin Henk
The Representation of Polyhedra by Polynomial Inequalities. Discret. Comput. Geom. 29 (4) (2003)
Martin Henk, Matthias Köppe, Robert Weismantel
Integral decomposition of polyhedra and some applications in mixed integer programming. Math. Program. 94 (2-3) (2003)
Martin Henk, Robert Weismantel
Diophantine Approximations and Integer Points of Cones. Comb. 22 (3) (2002)
Ulrich Betke, Martin Henk
Densest lattice packings of 3-polytopes. Comput. Geom. 16 (3) (2000)
Bernd Gärtner, Martin Henk, Günter M. Ziegler
Randomized Simplex Algorithms on Klee-Minty Cubes. Comb. 18 (3) (1998)
Ulrich Betke, Martin Henk
Finite Packings of Spheres. Discret. Comput. Geom. 19 (2) (1998)
Ulrich Betke, Martin Henk, L. Tsintsifa
Inradii of Simplices. Discret. Comput. Geom. 17 (4) (1997)
Martin Henk
Note on Shortest and Nearest Lattice Vectors. Inf. Process. Lett. 61 (4) (1997)
Martin Henk, Robert Weismantel
Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations. ESA (1997)
Ulrich Betke, Martin Henk, Jörg M. Wills
Sausages are Good Packings. Discret. Comput. Geom. 13 (1995)
Ulrich Betke, Martin Henk, Jörg M. Wills
Successive-Minima-Type Inequalities. Discret. Comput. Geom. 9 (1993)
Ulrich Betke, Martin Henk
Approximating the Volume of Convex Bodies. Discret. Comput. Geom. 10 (1993)
Ulrich Betke, Martin Henk
Linear programming by minimizing distances. ZOR Methods Model. Oper. Res. 35 (4) (1991)