Martin Henk

Comput. Geom., 2024

Sparsity and Integrality Gap Transference Bounds for Integer Programs.

[BibT_eX]

[DOI]

Marcel Celaya

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023

On subspace concentration for dual curvature measures.

[BibT_eX]

[DOI]

Katharina Eller

Adv. Appl. Math., October, 2023

Proximity bounds for random integer programs.

[BibT_eX]

[DOI]

Marcel Celaya

Math. Program., February, 2023

2022

On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases.

[BibT_eX]

[DOI]

Stefan Kuhlmann

SIAM J. Discret. Math., September, 2022

Bounds on the Lattice Point Enumerator via Slices and Projections.

[BibT_eX]

[DOI]

Ansgar Freyer

Discret. Comput. Geom., 2022

2021

Distance-Sparsity Transference for Vertices of Corner Polyhedra.

[BibT_eX]

[DOI]

SIAM J. Optim., 2021

2020

Distances to lattice points in knapsack polyhedra.

[BibT_eX]

[DOI]

Timm Oertel

Math. Program., 2020

2018

A Note on Lattice Packings via Lattice Refinements.

[BibT_eX]

[DOI]

Exp. Math., 2018

2017

Integrality Gaps of Integer Knapsack Problems.

[BibT_eX]

[DOI]

Timm Oertel

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016

Lattice Point Inequalities for Centered Convex Bodies.

[BibT_eX]

[DOI]

Sören Lennart Berg

SIAM J. Discret. Math., 2016

2013

Integer Points in Knapsack Polytopes and s-Covering Radius.

[BibT_eX]

[DOI]

Eva Linke

Electron. J. Comb., 2013

2012

LLL-reduction for integer knapsacks.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

2011

Representing simple <i>d</i>-dimensional polytopes by <i>d</i> polynomials.

[BibT_eX]

[DOI]

Gennadiy Averkov

Math. Program., 2011

Expected Frobenius numbers.

[BibT_eX]

[DOI]

Aicke Hinrichs

J. Comb. Theory A, 2011

Notes on lattice points of zonotopes and lattice-face polytopes.

[BibT_eX]

[DOI]

Discret. Math., 2011

2010

Feasibility of Integer Knapsacks.

[BibT_eX]

[DOI]

SIAM J. Optim., 2010

2009

Integer Knapsacks: Average Behavior of the Frobenius Numbers.

[BibT_eX]

[DOI]

Math. Oper. Res., 2009

Lower bounds on the coefficients of Ehrhart polynomials.

[BibT_eX]

[DOI]

Makoto Tagami

Eur. J. Comb., 2009

Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities.

[BibT_eX]

[DOI]

Gennadiy Averkov

Discret. Comput. Geom., 2009

2007

Notes on the Roots of Ehrhart Polynomials.

[BibT_eX]

[DOI]

Christian Bey

Jörg M. Wills

Discret. Comput. Geom., 2007

2005

Polynomial inequalities representing polyhedra.

[BibT_eX]

[DOI]

Hartwig Bosse

Martin Grötschel

Math. Program., 2005

2004

Basic Properties of Convex Polytopes.

[BibT_eX]

[DOI]

Jürgen Richter-Gebert

Günter M. Ziegler

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

2003

Integral decomposition of polyhedra and some applications in mixed integer programming.

[BibT_eX]

[DOI]

Matthias Köppe

Math. Program., 2003

The Representation of Polyhedra by Polynomial Inequalities.

[BibT_eX]

[DOI]

Martin Grötschel

Discret. Comput. Geom., 2003

2002

Diophantine Approximations and Integer Points of Cones.

[BibT_eX]

[DOI]

Comb., 2002

2000

Densest lattice packings of 3-polytopes.

[BibT_eX]

[DOI]

Comput. Geom., 2000

1998

Finite Packings of Spheres.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

Randomized Simplex Algorithms on Klee-Minty Cubes.

[BibT_eX]

[DOI]

Bernd Gärtner

Günter M. Ziegler

Comb., 1998

1997

Note on Shortest and Nearest Lattice Vectors.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Inradii of Simplices.

[BibT_eX]

[DOI]

L. Tsintsifa

Discret. Comput. Geom., 1997

Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1995

Sausages are Good Packings.

[BibT_eX]

[DOI]

Jörg M. Wills

Discret. Comput. Geom., 1995

1993

Successive-Minima-Type Inequalities.

[BibT_eX]

[DOI]

Jörg M. Wills

Discret. Comput. Geom., 1993

Approximating the Volume of Convex Bodies.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1993

1991

Linear programming by minimizing distances.

[BibT_eX]

[DOI]