scientific article; zbMATH DE number 1342145
From MaRDI portal
Publication:4263727
zbMath0949.90079MaRDI QIDQ4263727
Publication date: 12 December 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items
On integer programming with bounded determinants, The width and integer optimization on simplices with bounded minors of the constraint matrices, On lattice point counting in \(\varDelta\)-modular polyhedra, Lattice-free simplices with lattice width \(2d - o(d)\), Unimodular triangulations of dilated 3-polytopes, About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces, Convex normality of rational polytopes with long edges, Enumeration and unimodular equivalence of empty delta-modular simplices, The diameter of lattice zonotopes, On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems, On the maximal width of empty lattice simplices, FPT-algorithms for some problems related to integer programming, Minimal polygons with fixed lattice width, On lattice-free orbit polytopes, The complete classification of empty lattice 4-simplices, On the rational polytopes with Chvátal rank 1, Gorenstein polytopes with trinomial \(h^*\)-polynomials, Hollow polytopes of large width, Elementary moves on lattice polytopes, The finiteness threshold width of lattice polytopes, FPT-algorithm for computing the width of a simplex given by a convex hull, The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point, An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem
