2 papers
math.OC2002
Relaxation, New Combinatorial and Polynomial Algorithms for the Linear Feasibility Problem
Ulrich Betke
We consider the homogenized linear feasibility problem, to find an on the unit sphere, satisfying line ar inequalities . To solve this problem we consider the…
math.MG1999
Densest Lattice Packings of 3-Polytopes
Ulrich Betke, Martin Henk
Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitra…